Debian Codegraph @

src/plugins/wp/tests/wp_acsl/oracle/init_value.1.res.oracle

raw
1 # frama-c -wp -wp-no-let [...]
2 [kernel] Parsing init_value.i (no preprocessing)
3 [wp] Running WP plugin...
4 [wp] Warning: Missing RTE guards
5 ------------------------------------------------------------
6 Function fa1
7 ------------------------------------------------------------
8
9 Goal Post-condition 'qed_ok' in 'fa1':
10 Let x = ta1_0[0].
11 Let x_1 = ta1_0[1].
12 Let x_2 = ta1_0[3].
13 Assume {
14 Type: is_sint32(x) /\ is_sint32(x_1) /\ is_sint32(x_2) /\
15 is_sint32(ta1_0[4]).
16 (* Heap *)
17 Type: IsArray_sint32(ta1_0).
18 }
19 Prove: (x_1 = x) /\ (x_2 = x_1).
20
21 ------------------------------------------------------------
22
23 Goal Post-condition 'qed_ko' in 'fa1':
24 Let x = ta1_0[4].
25 Assume {
26 Type: is_sint32(ta1_0[0]) /\ is_sint32(ta1_0[1]) /\ is_sint32(ta1_0[3]) /\
27 is_sint32(x).
28 (* Heap *)
29 Type: IsArray_sint32(ta1_0).
30 }
31 Prove: x = 0.
32
33 ------------------------------------------------------------
34
35 Goal Post-condition 'qed_ko' in 'fa1':
36 Let x = ta1_0[3].
37 Assume {
38 Type: is_sint32(ta1_0[0]) /\ is_sint32(ta1_0[1]) /\ is_sint32(x) /\
39 is_sint32(ta1_0[4]).
40 (* Heap *)
41 Type: IsArray_sint32(ta1_0).
42 }
43 Prove: x = 1.
44
45 ------------------------------------------------------------
46 ------------------------------------------------------------
47 Function fa2
48 ------------------------------------------------------------
49
50 Goal Post-condition 'qed_ok' in 'fa2':
51 Let x = ta2_0[0].
52 Let x_1 = ta2_0[1].
53 Let x_2 = ta2_0[4].
54 Assume {
55 Type: is_sint32(x) /\ is_sint32(x_1) /\ is_sint32(x_2).
56 (* Heap *)
57 Type: IsArray_sint32(ta2_0).
58 }
59 Prove: (x_1 = x) /\ (x_2 = x_1).
60
61 ------------------------------------------------------------
62
63 Goal Post-condition 'qed_ko' in 'fa2':
64 Let x = ta2_0[4].
65 Assume {
66 Type: is_sint32(ta2_0[0]) /\ is_sint32(ta2_0[1]) /\ is_sint32(x).
67 (* Heap *)
68 Type: IsArray_sint32(ta2_0).
69 }
70 Prove: x = 1.
71
72 ------------------------------------------------------------
73
74 Goal Post-condition 'qed_ko' in 'fa2':
75 Let x = ta2_0[1].
76 Assume {
77 Type: is_sint32(ta2_0[0]) /\ is_sint32(x) /\ is_sint32(ta2_0[4]).
78 (* Heap *)
79 Type: IsArray_sint32(ta2_0).
80 }
81 Prove: x = 1.
82
83 ------------------------------------------------------------
84 ------------------------------------------------------------
85 Function fa3
86 ------------------------------------------------------------
87
88 Goal Post-condition 'qed_ok' in 'fa3':
89 Let x = ta1_0[2].
90 Let x_1 = ta1_0[4].
91 Let x_2 = ta3_0[0].
92 Let x_3 = ta3_0[2].
93 Assume {
94 Type: is_sint32(x) /\ is_sint32(x_1) /\ is_sint32(ta2_0[4]) /\
95 is_sint32(x_2) /\ is_sint32(x_3).
96 (* Heap *)
97 Type: IsArray_sint32(ta1_0) /\ IsArray_sint32(ta2_0) /\
98 IsArray_sint32(ta3_0).
99 }
100 Prove: (x_1 = x) /\ (x_3 = x_2).
101
102 ------------------------------------------------------------
103
104 Goal Post-condition 'qed_ko' in 'fa3':
105 Let x = ta3_0[0].
106 Assume {
107 Type: is_sint32(ta1_0[2]) /\ is_sint32(ta1_0[4]) /\ is_sint32(ta2_0[4]) /\
108 is_sint32(x) /\ is_sint32(ta3_0[2]).
109 (* Heap *)
110 Type: IsArray_sint32(ta1_0) /\ IsArray_sint32(ta2_0) /\
111 IsArray_sint32(ta3_0).
112 }
113 Prove: x = 1.
114
115 ------------------------------------------------------------
116
117 Goal Post-condition 'qed_ko' in 'fa3':
118 Let x = ta3_0[2].
119 Assume {
120 Type: is_sint32(ta1_0[2]) /\ is_sint32(ta1_0[4]) /\ is_sint32(ta2_0[4]) /\
121 is_sint32(ta3_0[0]) /\ is_sint32(x).
122 (* Heap *)
123 Type: IsArray_sint32(ta1_0) /\ IsArray_sint32(ta2_0) /\
124 IsArray_sint32(ta3_0).
125 }
126 Prove: x = 1.
127
128 ------------------------------------------------------------
129
130 Goal Post-condition 'qed_ko' in 'fa3':
131 Let x = ta2_0[4].
132 Assume {
133 Type: is_sint32(ta1_0[2]) /\ is_sint32(ta1_0[4]) /\ is_sint32(x) /\
134 is_sint32(ta3_0[0]) /\ is_sint32(ta3_0[2]).
135 (* Heap *)
136 Type: IsArray_sint32(ta1_0) /\ IsArray_sint32(ta2_0) /\
137 IsArray_sint32(ta3_0).
138 }
139 Prove: x = 1.
140
141 ------------------------------------------------------------
142 ------------------------------------------------------------
143 Function fs1
144 ------------------------------------------------------------
145
146 Goal Post-condition 'qed_ok' in 'fs1':
147 Let a = ts1_0[0].
148 Let a_1 = ts1_0[1].
149 Let a_2 = ts1_0[3].
150 Let a_3 = ts1_0[2].
151 Let x = a_3.F5_a.
152 Let x_1 = a_3.F5_b.
153 Assume {
154 Type: IsS5(a) /\ IsS5(a_1) /\ IsS5(a_2) /\ is_sint32(a.F5_a) /\
155 is_sint32(x) /\ is_sint32(x_1) /\ is_sint32(a_3.F5_c).
156 (* Heap *)
157 Type: IsArray_S5(ts1_0).
158 }
159 Prove: (x_1 = x) /\ EqS5(a, a_1) /\ EqS5(a_1, a_2).
160
161 ------------------------------------------------------------
162
163 Goal Post-condition 'qed_ko' in 'fs1':
164 Let a = ts1_0[0].
165 Let a_1 = ts1_0[2].
166 Let x = a_1.F5_c.
167 Assume {
168 Type: IsS5(a) /\ IsS5(ts1_0[1]) /\ IsS5(ts1_0[3]) /\ is_sint32(a.F5_a) /\
169 is_sint32(a_1.F5_a) /\ is_sint32(a_1.F5_b) /\ is_sint32(x).
170 (* Heap *)
171 Type: IsArray_S5(ts1_0).
172 }
173 Prove: x = 1.
174
175 ------------------------------------------------------------
176
177 Goal Post-condition 'qed_ko' in 'fs1':
178 Let a = ts1_0[0].
179 Let x = a.F5_a.
180 Let a_1 = ts1_0[2].
181 Assume {
182 Type: IsS5(a) /\ IsS5(ts1_0[1]) /\ IsS5(ts1_0[3]) /\ is_sint32(x) /\
183 is_sint32(a_1.F5_a) /\ is_sint32(a_1.F5_b) /\ is_sint32(a_1.F5_c).
184 (* Heap *)
185 Type: IsArray_S5(ts1_0).
186 }
187 Prove: x = 1.
188
189 ------------------------------------------------------------
190 ------------------------------------------------------------
191 Function main_ko
192 ------------------------------------------------------------
193
194 Goal Pre-condition 'qed_ko,Sc_eq_ko' in 'main_ko':
195 Let a = sc3_0.F3_Sc_b.
196 Let a_1 = a[2].
197 Let x = sc2_0.F3_Sc_c.
198 Let a_2 = sc2_0.F3_Sc_b.
199 Let a_3 = st_0.F2_St_tab.
200 Let a_4 = a_3[3].
201 Assume {
202 Type: IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ is_uint8(tab_0[5]) /\
203 is_sint32(t[1]) /\ is_sint32(t1_0[6]) /\ is_sint32(x) /\
204 is_sint64(u.F4_U_b) /\ is_sint16((u.F4_U_t)[0]) /\ is_sint32(a_1) /\
205 is_sint32(a_4).
206 (* Heap *)
207 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
208 IsS2_St(st_0) /\ IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsU4_U(u).
209 (* Initializer *)
210 Init: t[0] = 1.
211 (* Initializer *)
212 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
213 (* Initializer *)
214 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
215 (* Initializer *)
216 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
217 (* Initializer *)
218 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
219 (* Initializer *)
220 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
221 (* Initializer *)
222 Init: a_3[0] = 1.
223 (* Initializer *)
224 Init: a_3[1] = 2.
225 (* Initializer *)
226 Init: a_3[2] = 3.
227 (* Initializer *)
228 Init: a_4 = 4.
229 (* Initializer *)
230 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_3[i] = 0))).
231 (* Initializer *)
232 Init: (sc2_0.F3_Sc_a) = 1.
233 (* Initializer *)
234 Init: a_2[0] = 2.
235 (* Initializer *)
236 Init: a_2[1] = 3.
237 (* Initializer *)
238 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_2[i] = 0))).
239 (* Initializer *)
240 Init: x = 4.
241 (* Initializer *)
242 Init: (sc3_0.F3_Sc_a) = 1.
243 (* Initializer *)
244 Init: a[0] = 2.
245 (* Initializer *)
246 Init: a[1] = 3.
247 (* Initializer *)
248 Init: a_1 = 4.
249 (* Initializer *)
250 Init: (sc3_0.F3_Sc_c) = 0.
251 (* Initializer *)
252 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
253 (* Initializer *)
254 Init: (u.F4_U_a) = (-1).
255 }
256 Prove: EqS3_Sc(sc2_0, sc3_0).
257
258 ------------------------------------------------------------
259
260 Goal Pre-condition 'qed_ko,Sc_t' in 'main_ko':
261 Let a = sc3_0.F3_Sc_b.
262 Let a_1 = a[2].
263 Let x = sc2_0.F3_Sc_c.
264 Let a_2 = sc2_0.F3_Sc_b.
265 Let a_3 = st_0.F2_St_tab.
266 Let a_4 = a_3[3].
267 Assume {
268 Type: IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ is_uint8(tab_0[5]) /\
269 is_sint32(t[1]) /\ is_sint32(t1_0[6]) /\ is_sint32(x) /\
270 is_sint64(u.F4_U_b) /\ is_sint16((u.F4_U_t)[0]) /\ is_sint32(a_1) /\
271 is_sint32(a_4).
272 (* Heap *)
273 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
274 IsS2_St(st_0) /\ IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsU4_U(u).
275 (* Initializer *)
276 Init: t[0] = 1.
277 (* Initializer *)
278 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
279 (* Initializer *)
280 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
281 (* Initializer *)
282 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
283 (* Initializer *)
284 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
285 (* Initializer *)
286 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
287 (* Initializer *)
288 Init: a_3[0] = 1.
289 (* Initializer *)
290 Init: a_3[1] = 2.
291 (* Initializer *)
292 Init: a_3[2] = 3.
293 (* Initializer *)
294 Init: a_4 = 4.
295 (* Initializer *)
296 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_3[i] = 0))).
297 (* Initializer *)
298 Init: (sc2_0.F3_Sc_a) = 1.
299 (* Initializer *)
300 Init: a_2[0] = 2.
301 (* Initializer *)
302 Init: a_2[1] = 3.
303 (* Initializer *)
304 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_2[i] = 0))).
305 (* Initializer *)
306 Init: x = 4.
307 (* Initializer *)
308 Init: (sc3_0.F3_Sc_a) = 1.
309 (* Initializer *)
310 Init: a[0] = 2.
311 (* Initializer *)
312 Init: a[1] = 3.
313 (* Initializer *)
314 Init: a_1 = 4.
315 (* Initializer *)
316 Init: (sc3_0.F3_Sc_c) = 0.
317 (* Initializer *)
318 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
319 (* Initializer *)
320 Init: (u.F4_U_a) = (-1).
321 }
322 Prove: a_1 = 3.
323
324 ------------------------------------------------------------
325
326 Goal Pre-condition 'qed_ko,Sc_c_2' in 'main_ko':
327 Let a = sc3_0.F3_Sc_b.
328 Let a_1 = a[2].
329 Let x = sc2_0.F3_Sc_c.
330 Let a_2 = sc2_0.F3_Sc_b.
331 Let a_3 = st_0.F2_St_tab.
332 Let a_4 = a_3[3].
333 Assume {
334 Type: IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ is_uint8(tab_0[5]) /\
335 is_sint32(t[1]) /\ is_sint32(t1_0[6]) /\ is_sint32(x) /\
336 is_sint64(u.F4_U_b) /\ is_sint16((u.F4_U_t)[0]) /\ is_sint32(a_1) /\
337 is_sint32(a_4).
338 (* Heap *)
339 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
340 IsS2_St(st_0) /\ IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsU4_U(u).
341 (* Initializer *)
342 Init: t[0] = 1.
343 (* Initializer *)
344 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
345 (* Initializer *)
346 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
347 (* Initializer *)
348 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
349 (* Initializer *)
350 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
351 (* Initializer *)
352 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
353 (* Initializer *)
354 Init: a_3[0] = 1.
355 (* Initializer *)
356 Init: a_3[1] = 2.
357 (* Initializer *)
358 Init: a_3[2] = 3.
359 (* Initializer *)
360 Init: a_4 = 4.
361 (* Initializer *)
362 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_3[i] = 0))).
363 (* Initializer *)
364 Init: (sc2_0.F3_Sc_a) = 1.
365 (* Initializer *)
366 Init: a_2[0] = 2.
367 (* Initializer *)
368 Init: a_2[1] = 3.
369 (* Initializer *)
370 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_2[i] = 0))).
371 (* Initializer *)
372 Init: x = 4.
373 (* Initializer *)
374 Init: (sc3_0.F3_Sc_a) = 1.
375 (* Initializer *)
376 Init: a[0] = 2.
377 (* Initializer *)
378 Init: a[1] = 3.
379 (* Initializer *)
380 Init: a_1 = 4.
381 (* Initializer *)
382 Init: (sc3_0.F3_Sc_c) = 0.
383 (* Initializer *)
384 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
385 (* Initializer *)
386 Init: (u.F4_U_a) = (-1).
387 }
388 Prove: x = 2.
389
390 ------------------------------------------------------------
391
392 Goal Pre-condition 'qed_ko,Tab_no_init' in 'main_ko':
393 Let a = sc3_0.F3_Sc_b.
394 Let a_1 = a[2].
395 Let x = sc2_0.F3_Sc_c.
396 Let a_2 = sc2_0.F3_Sc_b.
397 Let a_3 = st_0.F2_St_tab.
398 Let a_4 = a_3[3].
399 Let x_1 = tab_0[5].
400 Assume {
401 Type: IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ is_uint8(x_1) /\
402 is_sint32(t[1]) /\ is_sint32(t1_0[6]) /\ is_sint32(x) /\
403 is_sint64(u.F4_U_b) /\ is_sint16((u.F4_U_t)[0]) /\ is_sint32(a_1) /\
404 is_sint32(a_4).
405 (* Heap *)
406 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
407 IsS2_St(st_0) /\ IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsU4_U(u).
408 (* Initializer *)
409 Init: t[0] = 1.
410 (* Initializer *)
411 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
412 (* Initializer *)
413 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
414 (* Initializer *)
415 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
416 (* Initializer *)
417 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
418 (* Initializer *)
419 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
420 (* Initializer *)
421 Init: a_3[0] = 1.
422 (* Initializer *)
423 Init: a_3[1] = 2.
424 (* Initializer *)
425 Init: a_3[2] = 3.
426 (* Initializer *)
427 Init: a_4 = 4.
428 (* Initializer *)
429 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_3[i] = 0))).
430 (* Initializer *)
431 Init: (sc2_0.F3_Sc_a) = 1.
432 (* Initializer *)
433 Init: a_2[0] = 2.
434 (* Initializer *)
435 Init: a_2[1] = 3.
436 (* Initializer *)
437 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_2[i] = 0))).
438 (* Initializer *)
439 Init: x = 4.
440 (* Initializer *)
441 Init: (sc3_0.F3_Sc_a) = 1.
442 (* Initializer *)
443 Init: a[0] = 2.
444 (* Initializer *)
445 Init: a[1] = 3.
446 (* Initializer *)
447 Init: a_1 = 4.
448 (* Initializer *)
449 Init: (sc3_0.F3_Sc_c) = 0.
450 (* Initializer *)
451 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
452 (* Initializer *)
453 Init: (u.F4_U_a) = (-1).
454 }
455 Prove: x_1 = 1.
456
457 ------------------------------------------------------------
458
459 Goal Pre-condition 'qed_ko,With_Array_Struct_3' in 'main_ko':
460 Let a = sc3_0.F3_Sc_b.
461 Let a_1 = a[2].
462 Let x = sc2_0.F3_Sc_c.
463 Let a_2 = sc2_0.F3_Sc_b.
464 Let a_3 = st_0.F2_St_tab.
465 Let a_4 = a_3[3].
466 Assume {
467 Type: IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ is_uint8(tab_0[5]) /\
468 is_sint32(t[1]) /\ is_sint32(t1_0[6]) /\ is_sint32(x) /\
469 is_sint64(u.F4_U_b) /\ is_sint16((u.F4_U_t)[0]) /\ is_sint32(a_1) /\
470 is_sint32(a_4).
471 (* Heap *)
472 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
473 IsS2_St(st_0) /\ IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsU4_U(u).
474 (* Initializer *)
475 Init: t[0] = 1.
476 (* Initializer *)
477 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
478 (* Initializer *)
479 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
480 (* Initializer *)
481 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
482 (* Initializer *)
483 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
484 (* Initializer *)
485 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
486 (* Initializer *)
487 Init: a_3[0] = 1.
488 (* Initializer *)
489 Init: a_3[1] = 2.
490 (* Initializer *)
491 Init: a_3[2] = 3.
492 (* Initializer *)
493 Init: a_4 = 4.
494 (* Initializer *)
495 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_3[i] = 0))).
496 (* Initializer *)
497 Init: (sc2_0.F3_Sc_a) = 1.
498 (* Initializer *)
499 Init: a_2[0] = 2.
500 (* Initializer *)
501 Init: a_2[1] = 3.
502 (* Initializer *)
503 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_2[i] = 0))).
504 (* Initializer *)
505 Init: x = 4.
506 (* Initializer *)
507 Init: (sc3_0.F3_Sc_a) = 1.
508 (* Initializer *)
509 Init: a[0] = 2.
510 (* Initializer *)
511 Init: a[1] = 3.
512 (* Initializer *)
513 Init: a_1 = 4.
514 (* Initializer *)
515 Init: (sc3_0.F3_Sc_c) = 0.
516 (* Initializer *)
517 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
518 (* Initializer *)
519 Init: (u.F4_U_a) = (-1).
520 }
521 Prove: a_4 = 3.
522
523 ------------------------------------------------------------
524
525 Goal Pre-condition 'qed_ko,Simple_Array_1' in 'main_ko':
526 Let a = sc3_0.F3_Sc_b.
527 Let a_1 = a[2].
528 Let x = sc2_0.F3_Sc_c.
529 Let a_2 = sc2_0.F3_Sc_b.
530 Let a_3 = st_0.F2_St_tab.
531 Let a_4 = a_3[3].
532 Let x_1 = t[1].
533 Assume {
534 Type: IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ is_uint8(tab_0[5]) /\
535 is_sint32(x_1) /\ is_sint32(t1_0[6]) /\ is_sint32(x) /\
536 is_sint64(u.F4_U_b) /\ is_sint16((u.F4_U_t)[0]) /\ is_sint32(a_1) /\
537 is_sint32(a_4).
538 (* Heap *)
539 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
540 IsS2_St(st_0) /\ IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsU4_U(u).
541 (* Initializer *)
542 Init: t[0] = 1.
543 (* Initializer *)
544 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
545 (* Initializer *)
546 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
547 (* Initializer *)
548 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
549 (* Initializer *)
550 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
551 (* Initializer *)
552 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
553 (* Initializer *)
554 Init: a_3[0] = 1.
555 (* Initializer *)
556 Init: a_3[1] = 2.
557 (* Initializer *)
558 Init: a_3[2] = 3.
559 (* Initializer *)
560 Init: a_4 = 4.
561 (* Initializer *)
562 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_3[i] = 0))).
563 (* Initializer *)
564 Init: (sc2_0.F3_Sc_a) = 1.
565 (* Initializer *)
566 Init: a_2[0] = 2.
567 (* Initializer *)
568 Init: a_2[1] = 3.
569 (* Initializer *)
570 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_2[i] = 0))).
571 (* Initializer *)
572 Init: x = 4.
573 (* Initializer *)
574 Init: (sc3_0.F3_Sc_a) = 1.
575 (* Initializer *)
576 Init: a[0] = 2.
577 (* Initializer *)
578 Init: a[1] = 3.
579 (* Initializer *)
580 Init: a_1 = 4.
581 (* Initializer *)
582 Init: (sc3_0.F3_Sc_c) = 0.
583 (* Initializer *)
584 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
585 (* Initializer *)
586 Init: (u.F4_U_a) = (-1).
587 }
588 Prove: x_1 = 1.
589
590 ------------------------------------------------------------
591
592 Goal Pre-condition 'qed_ko,T1_6' in 'main_ko':
593 Let a = sc3_0.F3_Sc_b.
594 Let a_1 = a[2].
595 Let x = sc2_0.F3_Sc_c.
596 Let a_2 = sc2_0.F3_Sc_b.
597 Let a_3 = st_0.F2_St_tab.
598 Let a_4 = a_3[3].
599 Let x_1 = t1_0[6].
600 Assume {
601 Type: IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ is_uint8(tab_0[5]) /\
602 is_sint32(t[1]) /\ is_sint32(x_1) /\ is_sint32(x) /\
603 is_sint64(u.F4_U_b) /\ is_sint16((u.F4_U_t)[0]) /\ is_sint32(a_1) /\
604 is_sint32(a_4).
605 (* Heap *)
606 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
607 IsS2_St(st_0) /\ IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsU4_U(u).
608 (* Initializer *)
609 Init: t[0] = 1.
610 (* Initializer *)
611 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
612 (* Initializer *)
613 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
614 (* Initializer *)
615 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
616 (* Initializer *)
617 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
618 (* Initializer *)
619 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
620 (* Initializer *)
621 Init: a_3[0] = 1.
622 (* Initializer *)
623 Init: a_3[1] = 2.
624 (* Initializer *)
625 Init: a_3[2] = 3.
626 (* Initializer *)
627 Init: a_4 = 4.
628 (* Initializer *)
629 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_3[i] = 0))).
630 (* Initializer *)
631 Init: (sc2_0.F3_Sc_a) = 1.
632 (* Initializer *)
633 Init: a_2[0] = 2.
634 (* Initializer *)
635 Init: a_2[1] = 3.
636 (* Initializer *)
637 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_2[i] = 0))).
638 (* Initializer *)
639 Init: x = 4.
640 (* Initializer *)
641 Init: (sc3_0.F3_Sc_a) = 1.
642 (* Initializer *)
643 Init: a[0] = 2.
644 (* Initializer *)
645 Init: a[1] = 3.
646 (* Initializer *)
647 Init: a_1 = 4.
648 (* Initializer *)
649 Init: (sc3_0.F3_Sc_c) = 0.
650 (* Initializer *)
651 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
652 (* Initializer *)
653 Init: (u.F4_U_a) = (-1).
654 }
655 Prove: x_1 = 0.
656
657 ------------------------------------------------------------
658
659 Goal Pre-condition 'qed_ko,indirect_init_union_b' in 'main_ko':
660 Let a = sc3_0.F3_Sc_b.
661 Let a_1 = a[2].
662 Let x = sc2_0.F3_Sc_c.
663 Let a_2 = sc2_0.F3_Sc_b.
664 Let a_3 = st_0.F2_St_tab.
665 Let a_4 = a_3[3].
666 Let x_1 = u.F4_U_b.
667 Assume {
668 Type: IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ is_uint8(tab_0[5]) /\
669 is_sint32(t[1]) /\ is_sint32(t1_0[6]) /\ is_sint32(x) /\
670 is_sint64(x_1) /\ is_sint16((u.F4_U_t)[0]) /\ is_sint32(a_1) /\
671 is_sint32(a_4).
672 (* Heap *)
673 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
674 IsS2_St(st_0) /\ IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsU4_U(u).
675 (* Initializer *)
676 Init: t[0] = 1.
677 (* Initializer *)
678 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
679 (* Initializer *)
680 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
681 (* Initializer *)
682 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
683 (* Initializer *)
684 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
685 (* Initializer *)
686 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
687 (* Initializer *)
688 Init: a_3[0] = 1.
689 (* Initializer *)
690 Init: a_3[1] = 2.
691 (* Initializer *)
692 Init: a_3[2] = 3.
693 (* Initializer *)
694 Init: a_4 = 4.
695 (* Initializer *)
696 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_3[i] = 0))).
697 (* Initializer *)
698 Init: (sc2_0.F3_Sc_a) = 1.
699 (* Initializer *)
700 Init: a_2[0] = 2.
701 (* Initializer *)
702 Init: a_2[1] = 3.
703 (* Initializer *)
704 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_2[i] = 0))).
705 (* Initializer *)
706 Init: x = 4.
707 (* Initializer *)
708 Init: (sc3_0.F3_Sc_a) = 1.
709 (* Initializer *)
710 Init: a[0] = 2.
711 (* Initializer *)
712 Init: a[1] = 3.
713 (* Initializer *)
714 Init: a_1 = 4.
715 (* Initializer *)
716 Init: (sc3_0.F3_Sc_c) = 0.
717 (* Initializer *)
718 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
719 (* Initializer *)
720 Init: (u.F4_U_a) = (-1).
721 }
722 Prove: x_1 = 0.
723
724 ------------------------------------------------------------
725
726 Goal Pre-condition 'qed_ko,indirect_init_union_t' in 'main_ko':
727 Let a = sc3_0.F3_Sc_b.
728 Let a_1 = a[2].
729 Let x = sc2_0.F3_Sc_c.
730 Let a_2 = sc2_0.F3_Sc_b.
731 Let a_3 = st_0.F2_St_tab.
732 Let a_4 = a_3[3].
733 Let a_5 = (u.F4_U_t)[0].
734 Assume {
735 Type: IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ is_uint8(tab_0[5]) /\
736 is_sint32(t[1]) /\ is_sint32(t1_0[6]) /\ is_sint32(x) /\
737 is_sint64(u.F4_U_b) /\ is_sint16(a_5) /\ is_sint32(a_1) /\
738 is_sint32(a_4).
739 (* Heap *)
740 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
741 IsS2_St(st_0) /\ IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsU4_U(u).
742 (* Initializer *)
743 Init: t[0] = 1.
744 (* Initializer *)
745 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
746 (* Initializer *)
747 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
748 (* Initializer *)
749 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
750 (* Initializer *)
751 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
752 (* Initializer *)
753 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
754 (* Initializer *)
755 Init: a_3[0] = 1.
756 (* Initializer *)
757 Init: a_3[1] = 2.
758 (* Initializer *)
759 Init: a_3[2] = 3.
760 (* Initializer *)
761 Init: a_4 = 4.
762 (* Initializer *)
763 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_3[i] = 0))).
764 (* Initializer *)
765 Init: (sc2_0.F3_Sc_a) = 1.
766 (* Initializer *)
767 Init: a_2[0] = 2.
768 (* Initializer *)
769 Init: a_2[1] = 3.
770 (* Initializer *)
771 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_2[i] = 0))).
772 (* Initializer *)
773 Init: x = 4.
774 (* Initializer *)
775 Init: (sc3_0.F3_Sc_a) = 1.
776 (* Initializer *)
777 Init: a[0] = 2.
778 (* Initializer *)
779 Init: a[1] = 3.
780 (* Initializer *)
781 Init: a_1 = 4.
782 (* Initializer *)
783 Init: (sc3_0.F3_Sc_c) = 0.
784 (* Initializer *)
785 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
786 (* Initializer *)
787 Init: (u.F4_U_a) = (-1).
788 }
789 Prove: a_5 = 0.
790
791 ------------------------------------------------------------