  We show that the problem of determining the existence of an inductive
invariant in the language of quantifier free linear integer arithmetic (QFLIA)
is undecidable, even for transition systems and safety properties expressed in
QFLIA.
