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_224 = 3; int INPUTS_at_224[3]; int input_at_224_counter = 0;int num_of_inputs_at_32 = 2; int INPUTS_at_32[2]; int input_at_32_counter = 0;int num_of_inputs_at_48 = 1; int INPUTS_at_48[1]; int input_at_48_counter = 0;int num_of_inputs_at_238 = 2; int INPUTS_at_238[2]; int input_at_238_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_224[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_32[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_48[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_238[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__)); |
2 | |
3 | /* Generated by CIL v. 1.3.6 */ |
4 | /* print_CIL_Input is true */ |
5 | |
6 | void error(void) |
7 | { |
8 | |
9 | { |
10 | __VERIFIER_assume(!((0 != INPUTS_at_238[1] && 0 != INPUTS_at_238[0] && 0 != INPUTS_at_224[1] && 0 != INPUTS_at_224[0] && 0 == INPUTS_at_224[2])));__VERIFIER_assume(!((0 != INPUTS_at_224[0])));__VERIFIER_error(); |
11 | return; |
12 | } |
13 | } |
14 | int m_pc = 0; |
15 | int t1_pc = 0; |
16 | int m_st ; |
17 | int t1_st ; |
18 | int m_i ; |
19 | int t1_i ; |
20 | int M_E = 2; |
21 | int T1_E = 2; |
22 | int E_M = 2; |
23 | int E_1 = 2; |
24 | int is_master_triggered(void) ; |
25 | int is_transmit1_triggered(void) ; |
26 | void immediate_notify(void) ; |
27 | int token ; |
28 | int __VERIFIER_nondet_int() ; |
29 | int local ; |
30 | void master(void) |
31 | { |
32 | int tmp_var = (input_at_32_counter < num_of_inputs_at_32) ? INPUTS_at_32[input_at_32_counter++] : __VERIFIER_nondet_int() ; |
33 | { |
34 | if (m_pc == 0) { |
35 | goto M_ENTRY; |
36 | } else { |
37 | if (m_pc == 1) { |
38 | goto M_WAIT; |
39 | } else { |
40 | |
41 | } |
42 | } |
43 | M_ENTRY: ; |
44 | { |
45 | while (1) { |
46 | while_0_continue: /* CIL Label */ ; |
47 | { |
48 | token = (input_at_48_counter < num_of_inputs_at_48) ? INPUTS_at_48[input_at_48_counter++] : __VERIFIER_nondet_int() ; |
49 | local = token; |
50 | E_1 = 1; |
51 | immediate_notify(); |
52 | E_1 = 2; |
53 | m_pc = 1; |
54 | m_st = 2; |
55 | } |
56 | |
57 | goto return_label; |
58 | M_WAIT: ; |
59 | if (token != local + 1) { |
60 | { |
61 | error(); |
62 | } |
63 | } else { |
64 | if(tmp_var <= 5){ |
65 | if(tmp_var >= 5){ |
66 | |
67 | } |
68 | } |
69 | |
70 | if(tmp_var <= 5){ |
71 | if(tmp_var >= 5){ |
72 | if(tmp_var == 5){ |
73 | error(); |
74 | } |
75 | } |
76 | } |
77 | } |
78 | } |
79 | while_0_break: /* CIL Label */ ; |
80 | } |
81 | |
82 | return_label: /* CIL Label */ |
83 | return; |
84 | } |
85 | } |
86 | void transmit1(void) |
87 | { |
88 | |
89 | { |
90 | if (t1_pc == 0) { |
91 | goto T1_ENTRY; |
92 | } else { |
93 | if (t1_pc == 1) { |
94 | goto T1_WAIT; |
95 | } else { |
96 | |
97 | } |
98 | } |
99 | T1_ENTRY: ; |
100 | { |
101 | while (1) { |
102 | while_1_continue: /* CIL Label */ ; |
103 | t1_pc = 1; |
104 | t1_st = 2; |
105 | |
106 | goto return_label; |
107 | T1_WAIT: |
108 | { |
109 | token += 1; |
110 | E_M = 1; |
111 | immediate_notify(); |
112 | E_M = 2; |
113 | } |
114 | } |
115 | while_1_break: /* CIL Label */ ; |
116 | } |
117 | |
118 | return_label: /* CIL Label */ |
119 | return; |
120 | } |
121 | } |
122 | int is_master_triggered(void) |
123 | { int __retres1 ; |
124 | |
125 | { |
126 | if (m_pc == 1) { |
127 | if (E_M == 1) { |
128 | __retres1 = 1; |
129 | goto return_label; |
130 | } else { |
131 | |
132 | } |
133 | } else { |
134 | |
135 | } |
136 | __retres1 = 0; |
137 | return_label: /* CIL Label */ |
138 | return (__retres1); |
139 | } |
140 | } |
141 | int is_transmit1_triggered(void) |
142 | { int __retres1 ; |
143 | |
144 | { |
145 | if (t1_pc == 1) { |
146 | if (E_1 == 1) { |
147 | __retres1 = 1; |
148 | goto return_label; |
149 | } else { |
150 | |
151 | } |
152 | } else { |
153 | |
154 | } |
155 | __retres1 = 0; |
156 | return_label: /* CIL Label */ |
157 | return (__retres1); |
158 | } |
159 | } |
160 | void update_channels(void) |
161 | { |
162 | |
163 | { |
164 | |
165 | return; |
166 | } |
167 | } |
168 | void init_threads(void) |
169 | { |
170 | |
171 | { |
172 | if (m_i == 1) { |
173 | m_st = 0; |
174 | } else { |
175 | m_st = 2; |
176 | } |
177 | if (t1_i == 1) { |
178 | t1_st = 0; |
179 | } else { |
180 | t1_st = 2; |
181 | } |
182 | |
183 | return; |
184 | } |
185 | } |
186 | int exists_runnable_thread(void) |
187 | { int __retres1 ; |
188 | |
189 | { |
190 | if (m_st == 0) { |
191 | __retres1 = 1; |
192 | goto return_label; |
193 | } else { |
194 | if (t1_st == 0) { |
195 | __retres1 = 1; |
196 | goto return_label; |
197 | } else { |
198 | |
199 | } |
200 | } |
201 | __retres1 = 0; |
202 | return_label: /* CIL Label */ |
203 | return (__retres1); |
204 | } |
205 | } |
206 | void eval(void) |
207 | { |
208 | int tmp ; |
209 | |
210 | { |
211 | { |
212 | while (1) { |
213 | while_2_continue: /* CIL Label */ ; |
214 | { |
215 | tmp = exists_runnable_thread(); |
216 | } |
217 | if (tmp != 0) { |
218 | |
219 | } else { |
220 | goto while_2_break; |
221 | } |
222 | if (m_st == 0) { |
223 | int tmp_ndt_1; |
224 | tmp_ndt_1 = (input_at_224_counter < num_of_inputs_at_224) ? INPUTS_at_224[input_at_224_counter++] : __VERIFIER_nondet_int() ; |
225 | if (tmp_ndt_1 != 0) { |
226 | { |
227 | m_st = 1; |
228 | master(); |
229 | } |
230 | } else { |
231 | |
232 | } |
233 | } else { |
234 | |
235 | } |
236 | if (t1_st == 0) { |
237 | int tmp_ndt_2; |
238 | tmp_ndt_2 = (input_at_238_counter < num_of_inputs_at_238) ? INPUTS_at_238[input_at_238_counter++] : __VERIFIER_nondet_int() ; |
239 | if (tmp_ndt_2 != 0) { |
240 | { |
241 | t1_st = 1; |
242 | transmit1(); |
243 | } |
244 | } else { |
245 | |
246 | } |
247 | } else { |
248 | |
249 | } |
250 | } |
251 | while_2_break: /* CIL Label */ ; |
252 | } |
253 | |
254 | return; |
255 | } |
256 | } |
257 | void fire_delta_events(void) |
258 | { |
259 | |
260 | { |
261 | if (M_E == 0) { |
262 | M_E = 1; |
263 | } else { |
264 | |
265 | } |
266 | if (T1_E == 0) { |
267 | T1_E = 1; |
268 | } else { |
269 | |
270 | } |
271 | if (E_M == 0) { |
272 | E_M = 1; |
273 | } else { |
274 | |
275 | } |
276 | if (E_1 == 0) { |
277 | E_1 = 1; |
278 | } else { |
279 | |
280 | } |
281 | |
282 | return; |
283 | } |
284 | } |
285 | void reset_delta_events(void) |
286 | { |
287 | |
288 | { |
289 | if (M_E == 1) { |
290 | M_E = 2; |
291 | } else { |
292 | |
293 | } |
294 | if (T1_E == 1) { |
295 | T1_E = 2; |
296 | } else { |
297 | |
298 | } |
299 | if (E_M == 1) { |
300 | E_M = 2; |
301 | } else { |
302 | |
303 | } |
304 | if (E_1 == 1) { |
305 | E_1 = 2; |
306 | } else { |
307 | |
308 | } |
309 | |
310 | return; |
311 | } |
312 | } |
313 | void activate_threads(void) |
314 | { int tmp ; |
315 | int tmp___0 ; |
316 | |
317 | { |
318 | { |
319 | tmp = is_master_triggered(); |
320 | } |
321 | if (tmp != 0) { |
322 | m_st = 0; |
323 | } else { |
324 | |
325 | } |
326 | { |
327 | tmp___0 = is_transmit1_triggered(); |
328 | } |
329 | if (tmp___0 != 0) { |
330 | t1_st = 0; |
331 | } else { |
332 | |
333 | } |
334 | |
335 | return; |
336 | } |
337 | } |
338 | void immediate_notify(void) |
339 | { |
340 | |
341 | { |
342 | { |
343 | activate_threads(); |
344 | } |
345 | |
346 | return; |
347 | } |
348 | } |
349 | void fire_time_events(void) |
350 | { |
351 | |
352 | { |
353 | M_E = 1; |
354 | |
355 | return; |
356 | } |
357 | } |
358 | void reset_time_events(void) |
359 | { |
360 | |
361 | { |
362 | if (M_E == 1) { |
363 | M_E = 2; |
364 | } else { |
365 | |
366 | } |
367 | if (T1_E == 1) { |
368 | T1_E = 2; |
369 | } else { |
370 | |
371 | } |
372 | if (E_M == 1) { |
373 | E_M = 2; |
374 | } else { |
375 | |
376 | } |
377 | if (E_1 == 1) { |
378 | E_1 = 2; |
379 | } else { |
380 | |
381 | } |
382 | |
383 | return; |
384 | } |
385 | } |
386 | void init_model(void) |
387 | { |
388 | |
389 | { |
390 | m_i = 1; |
391 | t1_i = 1; |
392 | |
393 | return; |
394 | } |
395 | } |
396 | int stop_simulation(void) |
397 | { int tmp ; |
398 | int __retres2 ; |
399 | |
400 | { |
401 | { |
402 | tmp = exists_runnable_thread(); |
403 | } |
404 | if (tmp != 0) { |
405 | __retres2 = 0; |
406 | goto return_label; |
407 | } else { |
408 | |
409 | } |
410 | __retres2 = 1; |
411 | return_label: /* CIL Label */ |
412 | return (__retres2); |
413 | } |
414 | } |
415 | void start_simulation(void) |
416 | { int kernel_st ; |
417 | int tmp ; |
418 | int tmp___0 ; |
419 | |
420 | { |
421 | { |
422 | kernel_st = 0; |
423 | update_channels(); |
424 | init_threads(); |
425 | fire_delta_events(); |
426 | activate_threads(); |
427 | reset_delta_events(); |
428 | } |
429 | { |
430 | while (1) { |
431 | while_3_continue: /* CIL Label */ ; |
432 | { |
433 | kernel_st = 1; |
434 | eval(); |
435 | } |
436 | { |
437 | kernel_st = 2; |
438 | update_channels(); |
439 | } |
440 | { |
441 | kernel_st = 3; |
442 | fire_delta_events(); |
443 | activate_threads(); |
444 | reset_delta_events(); |
445 | } |
446 | { |
447 | tmp = exists_runnable_thread(); |
448 | } |
449 | if (tmp == 0) { |
450 | { |
451 | kernel_st = 4; |
452 | fire_time_events(); |
453 | activate_threads(); |
454 | reset_time_events(); |
455 | } |
456 | } else { |
457 | |
458 | } |
459 | { |
460 | tmp___0 = stop_simulation(); |
461 | } |
462 | if (tmp___0 != 0) { |
463 | goto while_3_break; |
464 | } else { |
465 | |
466 | } |
467 | } |
468 | while_3_break: /* CIL Label */ ; |
469 | } |
470 | |
471 | return; |
472 | } |
473 | } |
474 | int main(void) |
475 | {initialize_reads(); int __retres1 ; |
476 | |
477 | { |
478 | { |
479 | init_model(); |
480 | start_simulation(); |
481 | } |
482 | __retres1 = 0; |
483 | return (__retres1); |
484 | } |
485 | } |
2017-05-11 15:58:17:206 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 15:58:17:315 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 15:58:20:333 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 15:58:20:375 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 15:58:20:409 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 15:58:20:683 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 15:58:21:420 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 15:58:21:547 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 15:58:21:692 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 15:58:22:199 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 15:58:22:219 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 15:58:22:246 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 15:58:22:256 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 15:58:22:738 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:58:25:651 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:58:25:686 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:58:26:254 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 15:58:30:595 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 15:58:30:596 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:30:596 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:37:096 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 15:58:37:096 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:37:096 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:40:382 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 15:58:40:383 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:40:383 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:42:587 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 15:58:42:588 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:42:588 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:44:011 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 15:58:44:012 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:44:012 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:49:628 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 20
2017-05-11 15:58:49:638 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:49:646 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:53:082 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 15:58:53:087 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:53:103 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:55:852 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 28
2017-05-11 15:58:55:852 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:55:869 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:57:766 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 32
2017-05-11 15:58:57:767 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:57:768 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:58:645 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 40
2017-05-11 15:58:58:645 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:58:646 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:58:59:554 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 44
2017-05-11 15:58:59:554 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:58:59:554 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:00:448 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 15:59:00:479 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 46
2017-05-11 15:59:00:479 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:59:00:479 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:01:243 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 50
2017-05-11 15:59:01:246 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:59:01:246 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:02:234 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 52
2017-05-11 15:59:02:234 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:59:02:235 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:03:069 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 56
2017-05-11 15:59:03:070 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:59:03:070 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:05:174 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 58
2017-05-11 15:59:05:174 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:59:05:175 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:07:130 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$AbstractionStrategyAdjuster.adjustConditions Adjusting abstraction strategy to NEVER
2017-05-11 15:59:07:130 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@40d68c65
2017-05-11 15:59:07:131 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:08:476 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 15:59:08:506 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties finished without usable result.
2017-05-11 15:59:34:860 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 15:59:34:860 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 15:59:34:867 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 15:59:34:868 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 15:59:34:886 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 15:59:56:391 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 16:00:14:311 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 16:00:14:313 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 16:00:14:318 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 16:00:14:319 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 16:00:14:340 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 16:00:35:215 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 16:00:51:936 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 16:00:51:936 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 16:00:52:518 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 16:00:53:841 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 16:00:54:030 WARNING Parallel analysis 1:PredicateCPA:PathFormulaManagerImpl.buildBranchingFormula ARG branching without AssumeEdge at ARG node 87541.
2017-05-11 16:00:54:031 WARNING Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Could not create error path because of missing branching information!
2017-05-11 16:00:54:209 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:54:580 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:54:581 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:54:846 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:54:846 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:55:243 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 16:00:55:244 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:55:637 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:55:637 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:56:212 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 16:00:56:212 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:56:760 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:56:761 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:57:072 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:57:073 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:57:377 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:57:377 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:57:818 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:57:819 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:58:240 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:58:241 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:59:129 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:59:130 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:00:59:878 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:00:59:879 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:01:00:263 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:01:00:263 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 16:01:00:627 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 16:01:00:629 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.
2017-05-11 16:01:00:635 INFO CPAchecker.runAlgorithm Stopping analysis ...
Parallel Algorithm statistics
-----------------------------
Number of algorithms used: 2
Successful analysis: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
PredicateCPA statistics
-----------------------
Number of abstractions: 14 (0% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 0 (0%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Because of target state: 14 (100%)
Times precision was empty: 14 (100%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 0 (0%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 0
Number of coverage checks: 632
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 374
Number of predicates discovered: 0
Time for post operator: 1.907s
Time for path formula creation: 1.897s
Time for strengthen operator: 0.009s
Time for prec operator: 0.005s
Time for abstraction: 0.001s (Max: 0.001s, Count: 14)
Solving time: 0.000s (Max: 0.000s)
Model enumeration time: 0.000s
Time for BDD construction: 0.000s (Max: 0.000s)
Time for merge operator: 0.055s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Total number of created targets for pointer analysis: 64
Number of created targets for uf: *signed_int is 9
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Invariant Generation statistics
-------------------------------
Bounds CPA statistics
---------------------
Bound k: 4
Maximum loop iteration reached: 5
ValueAnalysisCPA statistics
---------------------------
Number of variables: 45045 (count: 3119, min: 0, max: 25, avg: 14.44)
Number of global variables: 38160 (count: 3119, min: 0, max: 20, avg: 12.23)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 3437
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.037s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 53
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 1176
Number of deterministic Assumptions: 470
Level of Determinism: 40%
ConstraintsStrengthenOperator statistics
----------------------------------------
Total time for strengthening by ConstraintsCPA: 0.000s
Replaced symbolic expressions: 0
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.017s
Automaton transfers with branching: 0
Automaton transfer successors: 3437 (count: 3451, min: 0, max: 1, avg: 1.00) [0 x 14, 1 x 3437]
CPA algorithm statistics
------------------------
Number of iterations: 3142
Max size of waitlist: 18
Average size of waitlist: 7
Number of computed successors: 3437
Max successors for one state: 2
Number of times merged: 316
Number of times stopped: 316
Number of times breaked: 0
Total time for CPA algorithm: 3.457s (Max: 2.872s)
Time for choose from waitlist: 0.004s
Time for precision adjustment: 0.090s
Time for transfer relation: 3.257s
Time for merge operator: 0.070s
Time for stop operator: 0.008s
Time for adding to reached set: 0.012s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 3.477s
Time for final sat check: 1.323s
Time for error path creation: 0.190s
Time for bounding assertions check: 0.260s
Time for induction formula creation: 76.505s
Time for induction check: 68.949s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 12 (1200%)
Time for counterexample checks: 6.419s
Time for running CBMC: 6.149s
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.888s
Time for transition matches: 0.151s
Time for transition assertions: 0.000s
Time for transition actions: 0.001s
Automaton transfers with branching: 0
Automaton transfer successors: 51025 (count: 51193, min: 0, max: 1, avg: 1.00) [0 x 168, 1 x 51025]
CPA algorithm statistics
------------------------
Number of iterations: 48199
Max size of waitlist: 32
Average size of waitlist: 7
Number of computed successors: 51025
Max successors for one state: 2
Number of times merged: 7608
Number of times stopped: 8481
Number of times breaked: 0
Total time for CPA algorithm: 44.009s (Max: 8.233s)
Time for choose from waitlist: 0.251s
Time for precision adjustment: 1.200s
Time for transfer relation: 17.569s
Time for merge operator: 21.617s
Time for stop operator: 1.622s
Time for adding to reached set: 0.483s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 1.000
Visited lines: 184
Total lines: 198
Line coverage: 0.929
Visited conditions: 96
Total conditions: 110
Condition coverage: 0.873
CPAchecker general statistics
-----------------------------
Number of program locations: 404
Number of CFA edges: 495
Number of relevant variables: 59
Number of functions: 20
Number of loops: 6
Size of reached set: 3119
Number of reached locations: 374 (93%)
Avg states per location: 8
Max states per location: 30 (at node N129)
Number of reached functions: 20 (100%)
Number of partitions: 3119
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 14
Time for analysis setup: 2.969s
Time for loading CPAs: 0.787s
Time for loading parser: 0.730s
Time for CFA construction: 1.356s
Time for parsing file(s): 0.363s
Time for AST to CFA: 0.423s
Time for CFA sanity check: 0.064s
Time for post-processing: 0.403s
Time for var class.: 0.230s
Time for CFA export: 0.570s
Time for Analysis: 160.298s
CPU time for analysis: 220.080s
Time for analyzing result: 0.004s
Total time for CPAchecker: 163.288s
Total CPU time for CPAchecker: 224.980s
Time for statistics: 5.644s
Time for Garbage Collector: 8.921s (in 76 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 450MB ( 429 MiB) max; 232MB ( 221 MiB) avg; 520MB ( 496 MiB) peak
Used non-heap memory: 52MB ( 50 MiB) max; 49MB ( 47 MiB) avg; 59MB ( 57 MiB) peak
Used in PS Old Gen pool: 95MB ( 90 MiB) max; 47MB ( 45 MiB) avg; 95MB ( 90 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 952MB ( 908 MiB) avg
Allocated non-heap memory: 55MB ( 52 MiB) max; 52MB ( 49 MiB) avg
Total process virtual memory: 6665MB ( 6356 MiB) max; 6435MB ( 6137 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/token_ring.01_false-unreach-call_false-termination.cil/token_ring.01_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/token_ring.01_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