1.23
2.0
main
test-branch
| Line | |
|---|
| 1 | #include<assert.h>
|
|---|
| 2 |
|
|---|
| 3 | #pragma CIVL ACSL
|
|---|
| 4 |
|
|---|
| 5 | $input int N;
|
|---|
| 6 | $assume(N > 0);
|
|---|
| 7 |
|
|---|
| 8 | void arrayZeroes(int (*a)[], int n) {
|
|---|
| 9 | int i, j;
|
|---|
| 10 |
|
|---|
| 11 | /*@ loop invariant 0 <= i && i <= n;
|
|---|
| 12 | @ loop invariant \forall int t; 0<=t && t<i ==> (\forall int k; 0<=k && k<n ==>
|
|---|
| 13 | @ a[t][k] == 0);
|
|---|
| 14 | @ loop assigns i, j, a[0 .. n-1][0 .. n-1];
|
|---|
| 15 | @*/
|
|---|
| 16 | for (i = 0; i < n; i++) {
|
|---|
| 17 | /*@ loop invariant 0 <= j && j <= n;
|
|---|
| 18 | @ loop invariant \forall int k; 0<=k && k<j
|
|---|
| 19 | @ ==> a[i][k] == 0;
|
|---|
| 20 | @ loop assigns j, a[i][0 .. n-1];
|
|---|
| 21 | @*/
|
|---|
| 22 | for (j = 0; j < n; j++)
|
|---|
| 23 | a[i][j] = 0;
|
|---|
| 24 | }
|
|---|
| 25 | }
|
|---|
| 26 |
|
|---|
| 27 | int main() {
|
|---|
| 28 | int a[N][N];
|
|---|
| 29 |
|
|---|
| 30 | $havoc(&a);
|
|---|
| 31 | arrayZeroes(a, N);
|
|---|
| 32 | $assert($forall (int i : 0 .. N-1) ($forall (int j : 0 .. N-1) a[i][j] == 0));
|
|---|
| 33 | }
|
|---|
Note:
See
TracBrowser
for help on using the repository browser.