Matches in value-assignements (V): {{numOfValueMatches}}
Matches in edge-description: {{numOfDescriptionMatches}}
-V- |
{{line.desc}}
|
Zoom Factor (%)
Run scripts/report-generator.py to display CFAs.
Zoom Factor (%)
Run scripts/report-generator.py to display ARG.
1 | int num_of_inputs_at_449 = 8; int INPUTS_at_449[8]; int input_at_449_counter = 0;int num_of_inputs_at_467 = 6; int INPUTS_at_467[6]; int input_at_467_counter = 0;int num_of_inputs_at_439 = 8; int INPUTS_at_439[8]; int input_at_439_counter = 0;int num_of_inputs_at_459 = 8; int INPUTS_at_459[8]; int input_at_459_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<8; instrumentation_index++) INPUTS_at_449[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<6; instrumentation_index++) INPUTS_at_467[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<8; instrumentation_index++) INPUTS_at_439[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<8; instrumentation_index++) INPUTS_at_459[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__)); |
2 | |
3 | extern int __VERIFIER_nondet_int(void); |
4 | //extern int printf (__const char *__restrict __format, ...); |
5 | /* Generated by CIL v. 1.3.7 */ |
6 | /* print_CIL_Input is true */ |
7 | |
8 | struct JoinPoint { |
9 | void **(*fp)(struct JoinPoint * ) ; |
10 | void **args ; |
11 | int argsCount ; |
12 | char const **argsType ; |
13 | void *(*arg)(int , struct JoinPoint * ) ; |
14 | char const *(*argType)(int , struct JoinPoint * ) ; |
15 | void **retValue ; |
16 | char const *retType ; |
17 | char const *funcName ; |
18 | char const *targetName ; |
19 | char const *fileName ; |
20 | char const *kind ; |
21 | void *excep_return ; |
22 | }; |
23 | struct __UTAC__CFLOW_FUNC { |
24 | int (*func)(int , int ) ; |
25 | int val ; |
26 | struct __UTAC__CFLOW_FUNC *next ; |
27 | }; |
28 | struct __UTAC__EXCEPTION { |
29 | void *jumpbuf ; |
30 | unsigned long long prtValue ; |
31 | int pops ; |
32 | struct __UTAC__CFLOW_FUNC *cflowfuncs ; |
33 | }; |
34 | typedef unsigned int size_t; |
35 | struct __ACC__ERR { |
36 | void *v ; |
37 | struct __ACC__ERR *next ; |
38 | }; |
39 | #pragma merger(0,"wsllib_check.i","") |
40 | void __automaton_fail(void) |
41 | { |
42 | |
43 | { |
44 | __VERIFIER_assume(!((0 == INPUTS_at_459[1] && 0 == INPUTS_at_459[0] && 0 == INPUTS_at_467[1] && 0 == INPUTS_at_467[0] && 0 != INPUTS_at_439[1] && 0 == INPUTS_at_439[0] && 0 == INPUTS_at_449[0])));__VERIFIER_assume(!((0 != INPUTS_at_439[0] && 0 == INPUTS_at_449[1] && 0 == INPUTS_at_439[1] && 0 != INPUTS_at_459[1] && 0 != INPUTS_at_467[1])));__VERIFIER_assume(!((0 != INPUTS_at_439[0] && 0 == INPUTS_at_439[1] && 0 == INPUTS_at_467[1] && 0 == INPUTS_at_459[1] && 0 == INPUTS_at_467[0] && 0 == INPUTS_at_459[0])));__VERIFIER_assume(!((0 != INPUTS_at_449[2])));__VERIFIER_assume(!((0 != INPUTS_at_459[2])));__VERIFIER_assume(!((0 == INPUTS_at_467[2])));__VERIFIER_assume(!((0 == INPUTS_at_459[5])));__VERIFIER_assume(!((0 != INPUTS_at_439[4] && 0 == INPUTS_at_439[7] && 0 == INPUTS_at_449[5] && 0 == INPUTS_at_467[3] && 0 == INPUTS_at_459[4] && 0 == INPUTS_at_459[3] && 0 == INPUTS_at_459[1] && 0 == INPUTS_at_449[1] && 0 == INPUTS_at_439[0] && 0 == INPUTS_at_467[0] && 0 == INPUTS_at_459[0] && 0 != INPUTS_at_449[6] && 0 == INPUTS_at_467[4] && 0 != INPUTS_at_467[2] && 0 != INPUTS_at_459[5] && 0 != INPUTS_at_459[7] && 0 != INPUTS_at_467[5] && 0 != INPUTS_at_459[6] && 0 == INPUTS_at_439[6] && 0 != INPUTS_at_467[1])));__VERIFIER_error(); |
45 | return; |
46 | } |
47 | } |
48 | #pragma merger(0,"libacc.i","") |
49 | extern __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const *__assertion , |
50 | char const *__file , |
51 | unsigned int __line , |
52 | char const *__function ) ; |
53 | extern __attribute__((__nothrow__)) void *malloc(size_t __size ) __attribute__((__malloc__)) ; |
54 | extern __attribute__((__nothrow__)) void free(void *__ptr ) ; |
55 | void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int , |
56 | int ) , |
57 | int val ) |
58 | { struct __UTAC__EXCEPTION *excep ; |
59 | struct __UTAC__CFLOW_FUNC *cf ; |
60 | void *tmp ; |
61 | unsigned long __cil_tmp7 ; |
62 | unsigned long __cil_tmp8 ; |
63 | unsigned long __cil_tmp9 ; |
64 | unsigned long __cil_tmp10 ; |
65 | unsigned long __cil_tmp11 ; |
66 | unsigned long __cil_tmp12 ; |
67 | unsigned long __cil_tmp13 ; |
68 | unsigned long __cil_tmp14 ; |
69 | int (**mem_15)(int , int ) ; |
70 | int *mem_16 ; |
71 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
72 | struct __UTAC__CFLOW_FUNC **mem_18 ; |
73 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
74 | |
75 | { |
76 | { |
77 | excep = (struct __UTAC__EXCEPTION *)exception; |
78 | tmp = malloc(24UL); |
79 | cf = (struct __UTAC__CFLOW_FUNC *)tmp; |
80 | mem_15 = (int (**)(int , int ))cf; |
81 | *mem_15 = cflow_func; |
82 | __cil_tmp7 = (unsigned long )cf; |
83 | __cil_tmp8 = __cil_tmp7 + 8; |
84 | mem_16 = (int *)__cil_tmp8; |
85 | *mem_16 = val; |
86 | __cil_tmp9 = (unsigned long )cf; |
87 | __cil_tmp10 = __cil_tmp9 + 16; |
88 | __cil_tmp11 = (unsigned long )excep; |
89 | __cil_tmp12 = __cil_tmp11 + 24; |
90 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10; |
91 | mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12; |
92 | *mem_17 = *mem_18; |
93 | __cil_tmp13 = (unsigned long )excep; |
94 | __cil_tmp14 = __cil_tmp13 + 24; |
95 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
96 | *mem_19 = cf; |
97 | } |
98 | return; |
99 | } |
100 | } |
101 | void __utac__exception__cf_handler_free(void *exception ) |
102 | { struct __UTAC__EXCEPTION *excep ; |
103 | struct __UTAC__CFLOW_FUNC *cf ; |
104 | struct __UTAC__CFLOW_FUNC *tmp ; |
105 | unsigned long __cil_tmp5 ; |
106 | unsigned long __cil_tmp6 ; |
107 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
108 | unsigned long __cil_tmp8 ; |
109 | unsigned long __cil_tmp9 ; |
110 | unsigned long __cil_tmp10 ; |
111 | unsigned long __cil_tmp11 ; |
112 | void *__cil_tmp12 ; |
113 | unsigned long __cil_tmp13 ; |
114 | unsigned long __cil_tmp14 ; |
115 | struct __UTAC__CFLOW_FUNC **mem_15 ; |
116 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
117 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
118 | |
119 | { |
120 | excep = (struct __UTAC__EXCEPTION *)exception; |
121 | __cil_tmp5 = (unsigned long )excep; |
122 | __cil_tmp6 = __cil_tmp5 + 24; |
123 | mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
124 | cf = *mem_15; |
125 | { |
126 | while (1) { |
127 | while_0_continue: /* CIL Label */ ; |
128 | { |
129 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
130 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
131 | __cil_tmp9 = (unsigned long )cf; |
132 | if (__cil_tmp9 != __cil_tmp8) { |
133 | |
134 | } else { |
135 | goto while_0_break; |
136 | } |
137 | } |
138 | { |
139 | tmp = cf; |
140 | __cil_tmp10 = (unsigned long )cf; |
141 | __cil_tmp11 = __cil_tmp10 + 16; |
142 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11; |
143 | cf = *mem_16; |
144 | __cil_tmp12 = (void *)tmp; |
145 | free(__cil_tmp12); |
146 | } |
147 | } |
148 | while_0_break: /* CIL Label */ ; |
149 | } |
150 | __cil_tmp13 = (unsigned long )excep; |
151 | __cil_tmp14 = __cil_tmp13 + 24; |
152 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
153 | *mem_17 = (struct __UTAC__CFLOW_FUNC *)0; |
154 | return; |
155 | } |
156 | } |
157 | void __utac__exception__cf_handler_reset(void *exception ) |
158 | { struct __UTAC__EXCEPTION *excep ; |
159 | struct __UTAC__CFLOW_FUNC *cf ; |
160 | unsigned long __cil_tmp5 ; |
161 | unsigned long __cil_tmp6 ; |
162 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
163 | unsigned long __cil_tmp8 ; |
164 | unsigned long __cil_tmp9 ; |
165 | int (*__cil_tmp10)(int , int ) ; |
166 | unsigned long __cil_tmp11 ; |
167 | unsigned long __cil_tmp12 ; |
168 | int __cil_tmp13 ; |
169 | unsigned long __cil_tmp14 ; |
170 | unsigned long __cil_tmp15 ; |
171 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
172 | int (**mem_17)(int , int ) ; |
173 | int *mem_18 ; |
174 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
175 | |
176 | { |
177 | excep = (struct __UTAC__EXCEPTION *)exception; |
178 | __cil_tmp5 = (unsigned long )excep; |
179 | __cil_tmp6 = __cil_tmp5 + 24; |
180 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
181 | cf = *mem_16; |
182 | { |
183 | while (1) { |
184 | while_1_continue: /* CIL Label */ ; |
185 | { |
186 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
187 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
188 | __cil_tmp9 = (unsigned long )cf; |
189 | if (__cil_tmp9 != __cil_tmp8) { |
190 | |
191 | } else { |
192 | goto while_1_break; |
193 | } |
194 | } |
195 | { |
196 | mem_17 = (int (**)(int , int ))cf; |
197 | __cil_tmp10 = *mem_17; |
198 | __cil_tmp11 = (unsigned long )cf; |
199 | __cil_tmp12 = __cil_tmp11 + 8; |
200 | mem_18 = (int *)__cil_tmp12; |
201 | __cil_tmp13 = *mem_18; |
202 | (*__cil_tmp10)(4, __cil_tmp13); |
203 | __cil_tmp14 = (unsigned long )cf; |
204 | __cil_tmp15 = __cil_tmp14 + 16; |
205 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15; |
206 | cf = *mem_19; |
207 | } |
208 | } |
209 | while_1_break: /* CIL Label */ ; |
210 | } |
211 | { |
212 | __utac__exception__cf_handler_free(exception); |
213 | } |
214 | return; |
215 | } |
216 | } |
217 | void *__utac__error_stack_mgt(void *env , int mode , int count ) ; |
218 | static struct __ACC__ERR *head = (struct __ACC__ERR *)0; |
219 | void *__utac__error_stack_mgt(void *env , int mode , int count ) |
220 | { void *retValue_acc ; |
221 | struct __ACC__ERR *new ; |
222 | void *tmp ; |
223 | struct __ACC__ERR *temp ; |
224 | struct __ACC__ERR *next ; |
225 | void *excep ; |
226 | unsigned long __cil_tmp10 ; |
227 | unsigned long __cil_tmp11 ; |
228 | unsigned long __cil_tmp12 ; |
229 | unsigned long __cil_tmp13 ; |
230 | void *__cil_tmp14 ; |
231 | unsigned long __cil_tmp15 ; |
232 | unsigned long __cil_tmp16 ; |
233 | void *__cil_tmp17 ; |
234 | void **mem_18 ; |
235 | struct __ACC__ERR **mem_19 ; |
236 | struct __ACC__ERR **mem_20 ; |
237 | void **mem_21 ; |
238 | struct __ACC__ERR **mem_22 ; |
239 | void **mem_23 ; |
240 | void **mem_24 ; |
241 | |
242 | { |
243 | if (count == 0) { |
244 | return (retValue_acc); |
245 | } else { |
246 | |
247 | } |
248 | if (mode == 0) { |
249 | { |
250 | tmp = malloc(16UL); |
251 | new = (struct __ACC__ERR *)tmp; |
252 | mem_18 = (void **)new; |
253 | *mem_18 = env; |
254 | __cil_tmp10 = (unsigned long )new; |
255 | __cil_tmp11 = __cil_tmp10 + 8; |
256 | mem_19 = (struct __ACC__ERR **)__cil_tmp11; |
257 | *mem_19 = head; |
258 | head = new; |
259 | retValue_acc = (void *)new; |
260 | } |
261 | return (retValue_acc); |
262 | } else { |
263 | |
264 | } |
265 | if (mode == 1) { |
266 | temp = head; |
267 | { |
268 | while (1) { |
269 | while_2_continue: /* CIL Label */ ; |
270 | if (count > 1) { |
271 | |
272 | } else { |
273 | goto while_2_break; |
274 | } |
275 | { |
276 | __cil_tmp12 = (unsigned long )temp; |
277 | __cil_tmp13 = __cil_tmp12 + 8; |
278 | mem_20 = (struct __ACC__ERR **)__cil_tmp13; |
279 | next = *mem_20; |
280 | mem_21 = (void **)temp; |
281 | excep = *mem_21; |
282 | __cil_tmp14 = (void *)temp; |
283 | free(__cil_tmp14); |
284 | __utac__exception__cf_handler_reset(excep); |
285 | temp = next; |
286 | count = count - 1; |
287 | } |
288 | } |
289 | while_2_break: /* CIL Label */ ; |
290 | } |
291 | { |
292 | __cil_tmp15 = (unsigned long )temp; |
293 | __cil_tmp16 = __cil_tmp15 + 8; |
294 | mem_22 = (struct __ACC__ERR **)__cil_tmp16; |
295 | head = *mem_22; |
296 | mem_23 = (void **)temp; |
297 | excep = *mem_23; |
298 | __cil_tmp17 = (void *)temp; |
299 | free(__cil_tmp17); |
300 | __utac__exception__cf_handler_reset(excep); |
301 | retValue_acc = excep; |
302 | } |
303 | return (retValue_acc); |
304 | } else { |
305 | |
306 | } |
307 | if (mode == 2) { |
308 | if (head != 0) { |
309 | mem_24 = (void **)head; |
310 | retValue_acc = *mem_24; |
311 | return (retValue_acc); |
312 | } else { |
313 | retValue_acc = (void *)0; |
314 | return (retValue_acc); |
315 | } |
316 | } else { |
317 | |
318 | } |
319 | return (retValue_acc); |
320 | } |
321 | } |
322 | void *__utac__get_this_arg(int i , struct JoinPoint *this ) |
323 | { void *retValue_acc ; |
324 | unsigned long __cil_tmp4 ; |
325 | unsigned long __cil_tmp5 ; |
326 | int __cil_tmp6 ; |
327 | int __cil_tmp7 ; |
328 | unsigned long __cil_tmp8 ; |
329 | unsigned long __cil_tmp9 ; |
330 | void **__cil_tmp10 ; |
331 | void **__cil_tmp11 ; |
332 | int *mem_12 ; |
333 | void ***mem_13 ; |
334 | |
335 | { |
336 | if (i > 0) { |
337 | { |
338 | __cil_tmp4 = (unsigned long )this; |
339 | __cil_tmp5 = __cil_tmp4 + 16; |
340 | mem_12 = (int *)__cil_tmp5; |
341 | __cil_tmp6 = *mem_12; |
342 | if (i <= __cil_tmp6) { |
343 | |
344 | } else { |
345 | { |
346 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
347 | 123U, "__utac__get_this_arg"); |
348 | } |
349 | } |
350 | } |
351 | } else { |
352 | { |
353 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
354 | 123U, "__utac__get_this_arg"); |
355 | } |
356 | } |
357 | __cil_tmp7 = i - 1; |
358 | __cil_tmp8 = (unsigned long )this; |
359 | __cil_tmp9 = __cil_tmp8 + 8; |
360 | mem_13 = (void ***)__cil_tmp9; |
361 | __cil_tmp10 = *mem_13; |
362 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
363 | retValue_acc = *__cil_tmp11; |
364 | return (retValue_acc); |
365 | return (retValue_acc); |
366 | } |
367 | } |
368 | char const *__utac__get_this_argtype(int i , struct JoinPoint *this ) |
369 | { char const *retValue_acc ; |
370 | unsigned long __cil_tmp4 ; |
371 | unsigned long __cil_tmp5 ; |
372 | int __cil_tmp6 ; |
373 | int __cil_tmp7 ; |
374 | unsigned long __cil_tmp8 ; |
375 | unsigned long __cil_tmp9 ; |
376 | char const **__cil_tmp10 ; |
377 | char const **__cil_tmp11 ; |
378 | int *mem_12 ; |
379 | char const ***mem_13 ; |
380 | |
381 | { |
382 | if (i > 0) { |
383 | { |
384 | __cil_tmp4 = (unsigned long )this; |
385 | __cil_tmp5 = __cil_tmp4 + 16; |
386 | mem_12 = (int *)__cil_tmp5; |
387 | __cil_tmp6 = *mem_12; |
388 | if (i <= __cil_tmp6) { |
389 | |
390 | } else { |
391 | { |
392 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
393 | 131U, "__utac__get_this_argtype"); |
394 | } |
395 | } |
396 | } |
397 | } else { |
398 | { |
399 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
400 | 131U, "__utac__get_this_argtype"); |
401 | } |
402 | } |
403 | __cil_tmp7 = i - 1; |
404 | __cil_tmp8 = (unsigned long )this; |
405 | __cil_tmp9 = __cil_tmp8 + 24; |
406 | mem_13 = (char const ***)__cil_tmp9; |
407 | __cil_tmp10 = *mem_13; |
408 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
409 | retValue_acc = *__cil_tmp11; |
410 | return (retValue_acc); |
411 | return (retValue_acc); |
412 | } |
413 | } |
414 | #pragma merger(0,"scenario.i","") |
415 | void waterRise(void) ; |
416 | void changeMethaneLevel(void) ; |
417 | void startSystem(void) ; |
418 | void stopSystem(void) ; |
419 | void timeShift(void) ; |
420 | void cleanup(void) ; |
421 | void test(void) |
422 | { int splverifierCounter ; |
423 | int tmp ; |
424 | int tmp___0 ; |
425 | int tmp___1 ; |
426 | int tmp___2 ; |
427 | |
428 | { |
429 | splverifierCounter = 0; |
430 | { |
431 | while (1) { |
432 | while_3_continue: /* CIL Label */ ; |
433 | if (splverifierCounter < 4) { |
434 | |
435 | } else { |
436 | goto while_3_break; |
437 | } |
438 | { |
439 | tmp = (input_at_439_counter < num_of_inputs_at_439) ? INPUTS_at_439[input_at_439_counter++] : __VERIFIER_nondet_int() ; |
440 | } |
441 | if (tmp != 0) { |
442 | { |
443 | waterRise(); |
444 | } |
445 | } else { |
446 | |
447 | } |
448 | { |
449 | tmp___0 = (input_at_449_counter < num_of_inputs_at_449) ? INPUTS_at_449[input_at_449_counter++] : __VERIFIER_nondet_int() ; |
450 | } |
451 | if (tmp___0 != 0) { |
452 | { |
453 | changeMethaneLevel(); |
454 | } |
455 | } else { |
456 | |
457 | } |
458 | { |
459 | tmp___2 = (input_at_459_counter < num_of_inputs_at_459) ? INPUTS_at_459[input_at_459_counter++] : __VERIFIER_nondet_int() ; |
460 | } |
461 | if (tmp___2 != 0) { |
462 | { |
463 | startSystem(); |
464 | } |
465 | } else { |
466 | { |
467 | tmp___1 = (input_at_467_counter < num_of_inputs_at_467) ? INPUTS_at_467[input_at_467_counter++] : __VERIFIER_nondet_int() ; |
468 | } |
469 | if (tmp___1 != 0) { |
470 | { |
471 | stopSystem(); |
472 | } |
473 | } else { |
474 | |
475 | } |
476 | } |
477 | { |
478 | timeShift(); |
479 | } |
480 | } |
481 | while_3_break: /* CIL Label */ ; |
482 | } |
483 | { |
484 | cleanup(); |
485 | } |
486 | return; |
487 | } |
488 | } |
489 | #pragma merger(0,"MinePump.i","") |
490 | void lowerWaterLevel(void) ; |
491 | int isMethaneLevelCritical(void) ; |
492 | void printEnvironment(void) ; |
493 | int isHighWaterSensorDry(void) ; |
494 | void activatePump(void) ; |
495 | void deactivatePump(void) ; |
496 | int isPumpRunning(void) ; |
497 | void printPump(void) ; |
498 | int pumpRunning = 0; |
499 | int systemActive = 1; |
500 | void __utac_acc__Specification1_spec__1(void) ; |
501 | void processEnvironment(void) ; |
502 | void timeShift(void) |
503 | { |
504 | |
505 | { |
506 | if (pumpRunning != 0) { |
507 | { |
508 | lowerWaterLevel(); |
509 | } |
510 | } else { |
511 | |
512 | } |
513 | if (systemActive != 0) { |
514 | { |
515 | processEnvironment(); |
516 | } |
517 | } else { |
518 | |
519 | } |
520 | { |
521 | __utac_acc__Specification1_spec__1(); |
522 | } |
523 | return; |
524 | } |
525 | } |
526 | void processEnvironment__wrappee__base(void) |
527 | { |
528 | |
529 | { |
530 | return; |
531 | } |
532 | } |
533 | int isHighWaterLevel(void) ; |
534 | void processEnvironment(void) |
535 | { int tmp ; |
536 | |
537 | { |
538 | if (! pumpRunning) { |
539 | { |
540 | tmp = isHighWaterLevel(); |
541 | } |
542 | if (tmp != 0) { |
543 | { |
544 | activatePump(); |
545 | } |
546 | } else { |
547 | { |
548 | processEnvironment__wrappee__base(); |
549 | } |
550 | } |
551 | } else { |
552 | { |
553 | processEnvironment__wrappee__base(); |
554 | } |
555 | } |
556 | return; |
557 | } |
558 | } |
559 | void activatePump__wrappee__highWaterSensor(void) |
560 | { |
561 | |
562 | { |
563 | pumpRunning = 1; |
564 | return; |
565 | } |
566 | } |
567 | int isMethaneAlarm(void) ; |
568 | void activatePump(void) |
569 | { int tmp ; |
570 | |
571 | { |
572 | { |
573 | tmp = isMethaneAlarm(); |
574 | } |
575 | if (tmp != 0) { |
576 | |
577 | } else { |
578 | { |
579 | activatePump__wrappee__highWaterSensor(); |
580 | } |
581 | } |
582 | return; |
583 | } |
584 | } |
585 | void deactivatePump(void) |
586 | { |
587 | |
588 | { |
589 | pumpRunning = 0; |
590 | return; |
591 | } |
592 | } |
593 | int isMethaneAlarm(void) |
594 | { int retValue_acc ; |
595 | |
596 | { |
597 | { |
598 | retValue_acc = isMethaneLevelCritical(); |
599 | } |
600 | return (retValue_acc); |
601 | return (retValue_acc); |
602 | } |
603 | } |
604 | int isPumpRunning(void) |
605 | { int retValue_acc ; |
606 | |
607 | { |
608 | retValue_acc = pumpRunning; |
609 | return (retValue_acc); |
610 | return (retValue_acc); |
611 | } |
612 | } |
613 | void printPump(void) |
614 | { |
615 | |
616 | { |
617 | { |
618 | // printf("Pump(System:"); |
619 | } |
620 | if (systemActive != 0) { |
621 | { |
622 | // printf("On"); |
623 | } |
624 | } else { |
625 | { |
626 | // printf("Off"); |
627 | } |
628 | } |
629 | { |
630 | // printf(",Pump:"); |
631 | } |
632 | if (pumpRunning != 0) { |
633 | { |
634 | // printf("On"); |
635 | } |
636 | } else { |
637 | { |
638 | // printf("Off"); |
639 | } |
640 | } |
641 | { |
642 | // printf(") "); |
643 | printEnvironment(); |
644 | // printf("\n"); |
645 | } |
646 | return; |
647 | } |
648 | } |
649 | int isHighWaterLevel(void) |
650 | { int retValue_acc ; |
651 | int tmp ; |
652 | int tmp___0 ; |
653 | |
654 | { |
655 | { |
656 | tmp = isHighWaterSensorDry(); |
657 | } |
658 | if (tmp != 0) { |
659 | tmp___0 = 0; |
660 | } else { |
661 | tmp___0 = 1; |
662 | } |
663 | retValue_acc = tmp___0; |
664 | return (retValue_acc); |
665 | return (retValue_acc); |
666 | } |
667 | } |
668 | void stopSystem(void) |
669 | { |
670 | |
671 | { |
672 | if (pumpRunning != 0) { |
673 | { |
674 | deactivatePump(); |
675 | } |
676 | } else { |
677 | |
678 | } |
679 | systemActive = 0; |
680 | return; |
681 | } |
682 | } |
683 | void startSystem(void) |
684 | { |
685 | |
686 | { |
687 | systemActive = 1; |
688 | return; |
689 | } |
690 | } |
691 | #pragma merger(0,"Environment.i","") |
692 | int getWaterLevel(void) ; |
693 | int waterLevel = 1; |
694 | int methaneLevelCritical = 0; |
695 | void lowerWaterLevel(void) |
696 | { |
697 | |
698 | { |
699 | if (waterLevel > 0) { |
700 | waterLevel = waterLevel - 1; |
701 | } else { |
702 | |
703 | } |
704 | return; |
705 | } |
706 | } |
707 | void waterRise(void) |
708 | { |
709 | |
710 | { |
711 | if (waterLevel < 2) { |
712 | waterLevel = waterLevel + 1; |
713 | } else { |
714 | |
715 | } |
716 | return; |
717 | } |
718 | } |
719 | void changeMethaneLevel(void) |
720 | { |
721 | |
722 | { |
723 | if (methaneLevelCritical != 0) { |
724 | methaneLevelCritical = 0; |
725 | } else { |
726 | methaneLevelCritical = 1; |
727 | } |
728 | return; |
729 | } |
730 | } |
731 | int isMethaneLevelCritical(void) |
732 | { int retValue_acc ; |
733 | |
734 | { |
735 | retValue_acc = methaneLevelCritical; |
736 | return (retValue_acc); |
737 | return (retValue_acc); |
738 | } |
739 | } |
740 | void printEnvironment(void) |
741 | { |
742 | |
743 | { |
744 | { |
745 | // printf("Env(Water:%i", waterLevel); |
746 | // printf(",Meth:"); |
747 | } |
748 | if (methaneLevelCritical != 0) { |
749 | { |
750 | // printf("CRIT"); |
751 | } |
752 | } else { |
753 | { |
754 | // printf("OK"); |
755 | } |
756 | } |
757 | { |
758 | // printf(")"); |
759 | } |
760 | return; |
761 | } |
762 | } |
763 | int getWaterLevel(void) |
764 | { int retValue_acc ; |
765 | |
766 | { |
767 | retValue_acc = waterLevel; |
768 | return (retValue_acc); |
769 | return (retValue_acc); |
770 | } |
771 | } |
772 | int isHighWaterSensorDry(void) |
773 | { int retValue_acc ; |
774 | |
775 | { |
776 | if (waterLevel < 2) { |
777 | retValue_acc = 1; |
778 | return (retValue_acc); |
779 | } else { |
780 | retValue_acc = 0; |
781 | return (retValue_acc); |
782 | } |
783 | return (retValue_acc); |
784 | } |
785 | } |
786 | #pragma merger(0,"Specification1_spec.i","") |
787 | void __utac_acc__Specification1_spec__1(void) |
788 | { int tmp ; |
789 | int tmp___0 ; |
790 | |
791 | { |
792 | { |
793 | tmp = isMethaneLevelCritical(); |
794 | } |
795 | if (tmp != 0) { |
796 | { |
797 | tmp___0 = isPumpRunning(); |
798 | } |
799 | if (tmp___0 != 0) { |
800 | { |
801 | __automaton_fail(); |
802 | } |
803 | } else { |
804 | |
805 | } |
806 | } else { |
807 | |
808 | } |
809 | return; |
810 | } |
811 | } |
812 | #pragma merger(0,"featureselect.i","") |
813 | int select_one(void) ; |
814 | void select_features(void) ; |
815 | void select_helpers(void) ; |
816 | int valid_product(void) ; |
817 | int select_one(void) |
818 | { int retValue_acc ; |
819 | int choice = __VERIFIER_nondet_int(); |
820 | |
821 | { |
822 | retValue_acc = choice; |
823 | return (retValue_acc); |
824 | return (retValue_acc); |
825 | } |
826 | } |
827 | void select_features(void) |
828 | { |
829 | |
830 | { |
831 | return; |
832 | } |
833 | } |
834 | void select_helpers(void) |
835 | { |
836 | |
837 | { |
838 | return; |
839 | } |
840 | } |
841 | int valid_product(void) |
842 | { int retValue_acc ; |
843 | |
844 | { |
845 | retValue_acc = 1; |
846 | return (retValue_acc); |
847 | return (retValue_acc); |
848 | } |
849 | } |
850 | #pragma merger(0,"Test.i","") |
851 | int cleanupTimeShifts = 4; |
852 | void cleanup(void) |
853 | { int i ; |
854 | int __cil_tmp2 ; |
855 | |
856 | { |
857 | { |
858 | timeShift(); |
859 | i = 0; |
860 | } |
861 | { |
862 | while (1) { |
863 | while_4_continue: /* CIL Label */ ; |
864 | { |
865 | __cil_tmp2 = cleanupTimeShifts - 1; |
866 | if (i < __cil_tmp2) { |
867 | |
868 | } else { |
869 | goto while_4_break; |
870 | } |
871 | } |
872 | { |
873 | timeShift(); |
874 | i = i + 1; |
875 | } |
876 | } |
877 | while_4_break: /* CIL Label */ ; |
878 | } |
879 | return; |
880 | } |
881 | } |
882 | void Specification2(void) |
883 | { |
884 | |
885 | { |
886 | { |
887 | timeShift(); |
888 | printPump(); |
889 | timeShift(); |
890 | printPump(); |
891 | timeShift(); |
892 | printPump(); |
893 | waterRise(); |
894 | printPump(); |
895 | timeShift(); |
896 | printPump(); |
897 | changeMethaneLevel(); |
898 | printPump(); |
899 | timeShift(); |
900 | printPump(); |
901 | cleanup(); |
902 | } |
903 | return; |
904 | } |
905 | } |
906 | void setup(void) |
907 | { |
908 | |
909 | { |
910 | return; |
911 | } |
912 | } |
913 | void runTest(void) |
914 | { |
915 | |
916 | { |
917 | { |
918 | test(); |
919 | } |
920 | return; |
921 | } |
922 | } |
923 | int main(void) |
924 | {initialize_reads(); int retValue_acc ; |
925 | int tmp ; |
926 | |
927 | { |
928 | { |
929 | select_helpers(); |
930 | select_features(); |
931 | tmp = valid_product(); |
932 | } |
933 | if (tmp != 0) { |
934 | { |
935 | setup(); |
936 | runTest(); |
937 | } |
938 | } else { |
939 | |
940 | } |
941 | retValue_acc = 0; |
942 | return (retValue_acc); |
943 | return (retValue_acc); |
944 | } |
945 | } |
2017-05-11 21:08:39:276 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 21:08:39:417 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 21:08:41:277 INFO CFACreationUtils.addEdgeToCFA line 365: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:283 INFO CFACreationUtils.addEdgeToCFA line 411: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:306 INFO CFACreationUtils.addEdgeToCFA line 601: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:308 INFO CFACreationUtils.addEdgeToCFA line 610: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:319 INFO CFACreationUtils.addEdgeToCFA line 665: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:329 INFO CFACreationUtils.addEdgeToCFA line 737: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:331 INFO CFACreationUtils.addEdgeToCFA line 769: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:333 INFO CFACreationUtils.addEdgeToCFA line 783: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:346 INFO CFACreationUtils.addEdgeToCFA line 824: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:348 INFO CFACreationUtils.addEdgeToCFA line 847: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:363 INFO CFACreationUtils.addEdgeToCFA line 943: Dead code detected: return (retValue_acc);
2017-05-11 21:08:41:552 WARNING CFunctionPointerResolver.replaceFunctionPointerCall line 202: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.
2017-05-11 21:08:43:762 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 21:08:43:854 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 21:08:43:959 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 21:08:44:461 WARNING Parallel analysis 1:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 21:08:45:230 INFO Parallel analysis 1:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 21:08:45:356 WARNING Parallel analysis 1:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 21:08:45:612 WARNING Parallel analysis 1:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 21:08:46:387 WARNING Parallel analysis 1:InductionStepCase:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 21:08:46:395 INFO Parallel analysis 1:InductionStepCase:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 21:08:46:405 WARNING Parallel analysis 1:InductionStepCase:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 21:08:46:429 WARNING Parallel analysis 1:InductionStepCase:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 21:08:47:138 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 21:08:51:989 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 21:08:52:024 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 21:08:52:858 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 21:08:56:192 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 21:08:56:193 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:08:56:193 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:02:055 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 21:09:02:055 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:02:056 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:06:305 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 21:09:06:306 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:06:306 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:07:515 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 21:09:07:516 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:07:516 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:09:635 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 10
2017-05-11 21:09:09:643 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:09:643 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:11:400 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 21:09:11:406 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:11:406 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:12:560 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 14
2017-05-11 21:09:12:560 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:12:560 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:12:773 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 21:09:13:606 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 21:09:13:617 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:13:617 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:14:636 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 20
2017-05-11 21:09:14:636 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:14:636 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:15:623 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 28
2017-05-11 21:09:15:624 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:15:624 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:16:643 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 21:09:16:644 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 21:09:16:656 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 21:09:16:657 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 21:09:16:718 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 21:09:16:832 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 32
2017-05-11 21:09:16:833 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:16:833 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:18:369 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 34
2017-05-11 21:09:18:380 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:18:380 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:21:145 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 35
2017-05-11 21:09:21:154 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:21:158 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:22:805 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 37
2017-05-11 21:09:22:809 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:22:809 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:24:722 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 21:09:25:480 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 38
2017-05-11 21:09:25:481 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:25:481 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:29:165 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 39
2017-05-11 21:09:29:166 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:29:166 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:31:962 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 41
2017-05-11 21:09:31:963 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:31:964 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:33:876 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 45
2017-05-11 21:09:33:877 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:33:877 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:36:001 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 47
2017-05-11 21:09:36:002 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:36:002 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:37:761 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 51
2017-05-11 21:09:37:761 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:37:762 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:41:643 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 53
2017-05-11 21:09:41:644 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:09:41:644 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:09:49:890 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 21:09:49:890 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 21:09:49:900 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 21:09:49:905 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 21:09:49:993 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 21:09:54:909 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 21:10:01:046 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 54
2017-05-11 21:10:01:047 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:10:01:047 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:10:17:396 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 21:10:17:397 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 21:10:17:409 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 21:10:17:412 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 21:10:17:637 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 21:10:22:012 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 55
2017-05-11 21:10:22:012 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:10:22:012 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:10:26:143 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 21:10:43:610 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 5
2017-05-11 21:10:43:611 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 21:10:43:620 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 21:10:43:621 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 21:10:43:741 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 21:10:52:919 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 21:11:01:394 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 56
2017-05-11 21:11:01:395 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:11:01:395 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:11:24:669 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 6
2017-05-11 21:11:24:671 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 21:11:24:680 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 21:11:24:681 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 21:11:24:851 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 21:11:36:205 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 21:12:01:930 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 7
2017-05-11 21:12:01:931 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 21:12:01:942 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 21:12:01:943 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 21:12:02:115 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 21:12:12:784 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 21:12:16:078 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 57
2017-05-11 21:12:16:079 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:12:16:079 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:12:57:557 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 8
2017-05-11 21:12:57:557 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 21:12:57:566 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 21:12:57:567 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 21:12:57:763 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 21:13:31:445 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 21:13:32:004 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 58
2017-05-11 21:13:32:005 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:13:32:006 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:14:44:566 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 60
2017-05-11 21:14:44:566 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:14:44:567 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:15:56:915 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 64
2017-05-11 21:15:56:915 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5fe92cb4
2017-05-11 21:15:56:915 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 21:16:13:369 WARNING AbstractFuture.get Warning: Analysis interrupted
2017-05-11 21:16:13:377 WARNING ForceTerminationOnShutdown$1.shutdownRequested Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination.
2017-05-11 21:16:13:384 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
Parallel Algorithm statistics
-----------------------------
Number of algorithms used: 2
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
Cannot print statistics for this analysis because it is still running.
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================
Cannot print statistics for this analysis because it is still running.
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.026
Visited lines: 0
Total lines: 419
Line coverage: 0.000
Visited conditions: 0
Total conditions: 178
Condition coverage: 0.000
CPAchecker general statistics
-----------------------------
Number of program locations: 734
Number of CFA edges: 875
Number of relevant variables: 146
Number of functions: 38
Number of loops: 9
Size of reached set: 1
Number of reached locations: 1 (0%)
Avg states per location: 1
Max states per location: 1 (at node N709)
Number of reached functions: 1 (3%)
Number of partitions: 1
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 0
Size of final wait list 1
Time for analysis setup: 4.306s
Time for loading CPAs: 1.637s
Time for loading parser: 0.699s
Time for CFA construction: 1.822s
Time for parsing file(s): 0.503s
Time for AST to CFA: 0.556s
Time for CFA sanity check: 0.165s
Time for post-processing: 0.519s
Time for var class.: 0.291s
Time for CFA export: 1.354s
Time for Analysis: 449.602s
CPU time for analysis: 892.680s
Total time for CPAchecker: 453.926s
Total CPU time for CPAchecker: 900.220s
Time for statistics: 0.029s
Time for Garbage Collector: 41.418s (in 387 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 858MB ( 818 MiB) max; 439MB ( 418 MiB) avg; 894MB ( 852 MiB) peak
Used non-heap memory: 53MB ( 50 MiB) max; 50MB ( 48 MiB) avg; 53MB ( 51 MiB) peak
Used in PS Old Gen pool: 458MB ( 437 MiB) max; 241MB ( 230 MiB) avg; 458MB ( 437 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 988MB ( 942 MiB) avg
Allocated non-heap memory: 56MB ( 53 MiB) max; 54MB ( 52 MiB) avg
Total process virtual memory: 7481MB ( 7134 MiB) max; 6805MB ( 6490 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec1_product44_false-unreach-call_false-termination.cil/minepump_spec1_product44_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec1_product44_false-unreach-call_false-termination.cil/cpa_output
overflow.config = sv-comp16--k-induction-overflow.properties
parallelAlgorithm.configFiles = components/kInduction/svcomp16-kInduction.properties, components/invariantGeneration-no-out.properties::supply-reached-refinable
specification = /work/anon/anon/cfc/analyzers/cpachecker/config/specification/sv-comp-reachability.spc