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 verifies when it should not:
Observe that replacing
arr3 == arr2[2:=3]
witharr3 == arr1[2:=3]
and it correctly fails.