| 1 |
# frama-c -wp [...] |
| 2 |
[kernel] Parsing assigns_path.i (no preprocessing) |
| 3 |
[wp] Running WP plugin... |
| 4 |
[wp] Warning: Missing RTE guards |
| 5 |
------------------------------------------------------------ |
| 6 |
Function job |
| 7 |
------------------------------------------------------------ |
| 8 |
|
| 9 |
Goal Post-condition 'N' in 'job': |
| 10 |
Prove: true. |
| 11 |
|
| 12 |
------------------------------------------------------------ |
| 13 |
|
| 14 |
Goal Post-condition 'A' in 'job': |
| 15 |
Assume { |
| 16 |
Type: is_sint32(i_1) /\ is_sint32(n). |
| 17 |
(* Heap *) |
| 18 |
Type: region(b.base) <= 0. |
| 19 |
(* Goal *) |
| 20 |
When: (0 <= i) /\ (i < n). |
| 21 |
(* Pre-condition *) |
| 22 |
Have: n <= 3. |
| 23 |
(* Invariant *) |
| 24 |
Have: 0 <= n. |
| 25 |
(* Invariant *) |
| 26 |
Have: (0 <= i_1) /\ (i_1 <= n). |
| 27 |
(* Invariant *) |
| 28 |
Have: forall i_2 : Z. ((0 <= i_2) -> ((i_2 < i_1) -> |
| 29 |
(Mint_0[shift_sint32(b, i_2)] = v[i_2]))). |
| 30 |
(* Else *) |
| 31 |
Have: n <= i_1. |
| 32 |
} |
| 33 |
Prove: Mint_0[shift_sint32(b, i)] = v[i]. |
| 34 |
|
| 35 |
------------------------------------------------------------ |
| 36 |
|
| 37 |
Goal Preservation of Invariant (file assigns_path.i, line 16): |
| 38 |
Prove: true. |
| 39 |
|
| 40 |
------------------------------------------------------------ |
| 41 |
|
| 42 |
Goal Establishment of Invariant (file assigns_path.i, line 16): |
| 43 |
Prove: true. |
| 44 |
|
| 45 |
------------------------------------------------------------ |
| 46 |
|
| 47 |
Goal Preservation of Invariant (file assigns_path.i, line 17): |
| 48 |
Assume { |
| 49 |
Type: is_sint32(i) /\ is_sint32(n) /\ is_sint32(1 + i). |
| 50 |
(* Heap *) |
| 51 |
Type: region(b.base) <= 0. |
| 52 |
(* Goal *) |
| 53 |
When: (0 <= i_1) /\ (i_1 <= i). |
| 54 |
(* Pre-condition *) |
| 55 |
Have: n <= 3. |
| 56 |
(* Invariant *) |
| 57 |
Have: 0 <= n. |
| 58 |
(* Invariant *) |
| 59 |
Have: (0 <= i) /\ (i <= n). |
| 60 |
(* Invariant *) |
| 61 |
Have: forall i_2 : Z. ((0 <= i_2) -> ((i_2 < i) -> |
| 62 |
(Mint_0[shift_sint32(b, i_2)] = v[i_2]))). |
| 63 |
(* Then *) |
| 64 |
Have: i < n. |
| 65 |
(* Invariant *) |
| 66 |
Have: (-1) <= i. |
| 67 |
} |
| 68 |
Prove: v[i <- Mint_0[shift_sint32(b, i)]][i_1] = Mint_0[shift_sint32(b, i_1)]. |
| 69 |
|
| 70 |
------------------------------------------------------------ |
| 71 |
|
| 72 |
Goal Establishment of Invariant (file assigns_path.i, line 17): |
| 73 |
Prove: true. |
| 74 |
|
| 75 |
------------------------------------------------------------ |
| 76 |
|
| 77 |
Goal Loop assigns (file assigns_path.i, line 18): |
| 78 |
Prove: true. |
| 79 |
|
| 80 |
------------------------------------------------------------ |
| 81 |
|
| 82 |
Goal Assigns (file assigns_path.i, line 9) in 'job' (1/2): |
| 83 |
Prove: true. |
| 84 |
|
| 85 |
------------------------------------------------------------ |
| 86 |
|
| 87 |
Goal Assigns (file assigns_path.i, line 9) in 'job' (2/2): |
| 88 |
Effect at line 20 |
| 89 |
Prove: true. |
| 90 |
|
| 91 |
------------------------------------------------------------ |
| 92 |
[wp] assigns_path.i:12: Warning: |
| 93 |
Memory model hypotheses for function 'job': |
| 94 |
/*@ behavior wp_typed: |
| 95 |
requires \separated(b + (..), &p); */ |
| 96 |
void job(int n, int *b); |