Godel’s Incompleteness Theorem says that no model can ever be completely correct.
Not so. From Wikipedia:
"The first incompleteness theorem states that no consistent system of axioms whose theorems can be listed by an effective procedure (i.e., an algorithm) is capable of proving all truths about the arithmetic of the natural numbers. For any such formal system, there will always be statements about the natural numbers that are true, but that are unprovable within the system. The second incompleteness theorem, an extension of the first, shows that the system cannot demonstrate its own consistency."
Roughly, Godel's theorem(s) say that there are some true statements about the natural numbers (0, 1, 2, ...) that can't be proved.