The existence of polyhedral invariants is undecidable for linear systems
arXiv:2609.31146
Abstract
The existence of polyhedral inductive invariants suitable for proving that a given control location is unreachable is undecidable for programs using only linear arithmetic over Z or Q, by reduction from 2-counter machines.