blob: 14486b54f6fea49edc46f1c53847389e14afa27b (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
namespace;
include rt;
// the loop prover, case by case: each "kept" line must stay in zy --explain-checks
// and each "proved" line must not. run, it prints one checksum.
int touch() { return 0; }
int[16] sq;
int main() {
int i, j, k, s = 0, n = 4;
fixed int[?] a = rt.new(fixed int[?], 8);
fixed int[?] b = rt.new(fixed int[?], 10);
fixed int[?] c = rt.new(fixed int[?], 6);
fixed int[?] m = rt.new(fixed int[?], 16);
fixed int[?] m15 = rt.new(fixed int[?], 15);
int* p = rt.new(16);
// 1. i < len(a) in the test
for (i = 0; i < len(a); i++) a[i] = i; // proved
for (i = 0; i < len(a); i++) { s = s + a[i]; i = i + 0; } // kept: the body moves i
// 2. len(a) bounds another array of known length
for (i = 0; i < len(a); i++) s = s + b[i]; // proved: 8 <= 10
for (i = 0; i < len(a); i++) s = s + sq[i]; // proved: 8 <= 16
for (i = 0; i < len(a); i++) if (i < 6) s = s + c[i]; // kept: 6 < 8
// 3. a pointer of constant size at depth 2 and 3
for (i = 0; i < 2; i++) for (j = 0; j < 16; j++) p[j] = j; // proved
for (i = 0; i < 2; i++) for (k = 0; k < 2; k++) for (j = 0; j < 16; j++) s = s + p[j]; // proved
for (i = 0; i < 2; i++) for (j = 0; j < 16; j++) { s = s + p[j]; touch(); } // kept: the body calls
for (i = 0; i < 2; i++) { touch(); for (j = 0; j < 16; j++) s = s + p[j]; } // kept: the outer body calls
// 4. new(fixed int[?], n) with a constant n
for (i = 0; i < 6; i++) s = s + c[i]; // proved
for (i = 0; i < 7; i++) if (i < 6) s = s + c[i]; // kept: 7 > 6
// 5. i * n + k into exactly n * n
for (i = 0; i < 4; i++) for (k = 0; k < 4; k++) m[i * 4 + k] = i + k; // proved
for (i = 0; i < 4; i++) for (k = 0; k < 4; k++) s = s + p[i * 4 + k]; // proved
for (i = 0; i < 4; i++) for (k = 0; k < 4; k++) if (i * 4 + k < 15) s = s + m15[i * 4 + k]; // kept: 15 < 16
for (i = 0; i < 4; i++) for (k = 0; k < 5; k++) if (k < 4) s = s + m[i * 4 + k]; // kept: k < 5
for (i = 0; i < n; i++) for (k = 0; k < n; k++) s = s + m[i * n + k]; // kept: n is a variable
rt.put_n(s); rt.put_c(10);
rt.free(d*a); rt.free(d*b); rt.free(d*c); rt.free(d*m); rt.free(d*m15); rt.free(p);
return 0;
}
|
