The Whiley Theorem Prover (WyTP) is an automatic and interactive theorem prover designed to discharge verification conditions generated by the Whiley Compiler. WyTP operates over a variant of first-order logic which includes integer arithmetic, arrays and quantification.
The following assertion fails:
The essential problem seems to be that the following quantifier is not being instantiated:
We can see that this quantifier can, in effect, instantiate itself! Basically with
i==0
you have0 >= 1
giving the contradiction.