1 #include "proof/search.h"
5 requires valid: \valid_read(a + (0..n-1));
7 ensures result: 0 <= \result <= n;
8 ensures result: \result == Find(a, n, v);
11 find3(const value_type* a, size_type n, value_type v)
14 loop invariant bound: 0 <= i <= n;
15 loop invariant not_found: Find(a, i, v) == i;
19 for (size_type i = 0u; i < n; i++) {
21 //@ assert found: Find(a, n, v) == i;