Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/for_bounded_loop1_false-unreach-call_true-termination/for_bounded_loop1_false-unreach-call_true-termination.over.instr.c (Counterexample 1)

Generated on 2017-05-11 12:42:52 by CPAchecker 1.6.1-svn

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_24 = 7; int INPUTS_at_24[7]; int input_at_24_counter = 0;int num_of_inputs_at_15 = 1; int INPUTS_at_15[1]; int input_at_15_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<7; instrumentation_index++) INPUTS_at_24[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_15[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_error() __attribute__ ((__noreturn__));  
2
  
3
extern void __VERIFIER_assume(int);  
4
void __VERIFIER_assert(int cond) {  
5
  if (!(cond != 0)) {  
6
    __VERIFIER_assume(!((0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && 0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && INPUTS_at_15[0]- 1 < 1 + 0 && 0 != INPUTS_at_24[0])));__VERIFIER_assume(!((0 != INPUTS_at_24[1] && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 2 && INPUTS_at_24[0]- 2 < 1 + 0 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_15[0])));__VERIFIER_assume(!((0 == INPUTS_at_24[2] && 0 < 1 + INPUTS_at_24[1]- 3 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[2])));__VERIFIER_assume(!((0 == INPUTS_at_24[3] && 0 < 1 + INPUTS_at_24[2]- 4 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[3])));__VERIFIER_assume(!((0 == INPUTS_at_24[4] && 0 < 1 + INPUTS_at_24[3]- 5 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[4])));__VERIFIER_assume(!((0 == INPUTS_at_24[5] && 0 < 1 + INPUTS_at_24[4]- 6 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[5])));__VERIFIER_assume(!((0 == INPUTS_at_24[6] && 0 < 1 + INPUTS_at_24[5]- 7 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[6])));__VERIFIER_error();  
7
  }  
8
  return;  
9
}  
10
  
11
int __VERIFIER_nondet_int();  
12
  
13
int main() {initialize_reads();  
14
  int i=0, x=0, y=0;  
15
  int n= (input_at_15_counter < num_of_inputs_at_15) ? INPUTS_at_15[input_at_15_counter++] : __VERIFIER_nondet_int() ;  
16
  if (!(n>0))   
17
    return 0;  
18
  for(i=0; i<n; i++)  
19
  {  
20
    x = x-y;  
21
    if (!(x==0)) {  
22
  __VERIFIER_assume(!((0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && 0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && INPUTS_at_15[0]- 1 < 1 + 0 && 0 != INPUTS_at_24[0])));__VERIFIER_assume(!((0 != INPUTS_at_24[1] && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 2 && INPUTS_at_24[0]- 2 < 1 + 0 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_15[0])));__VERIFIER_assume(!((0 == INPUTS_at_24[2] && 0 < 1 + INPUTS_at_24[1]- 3 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[2])));__VERIFIER_assume(!((0 == INPUTS_at_24[3] && 0 < 1 + INPUTS_at_24[2]- 4 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[3])));__VERIFIER_assume(!((0 == INPUTS_at_24[4] && 0 < 1 + INPUTS_at_24[3]- 5 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[4])));__VERIFIER_assume(!((0 == INPUTS_at_24[5] && 0 < 1 + INPUTS_at_24[4]- 6 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[5])));__VERIFIER_assume(!((0 == INPUTS_at_24[6] && 0 < 1 + INPUTS_at_24[5]- 7 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[6])));__VERIFIER_error();  
23
}  
24
    y = (input_at_24_counter < num_of_inputs_at_24) ? INPUTS_at_24[input_at_24_counter++] : __VERIFIER_nondet_int() ;  
25
    if (!(y!=0))   
26
      return 0;  
27
    x = x+y;  
28
    if (!(x!=0)) {  
29
  __VERIFIER_assume(!((0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && 0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && INPUTS_at_15[0]- 1 < 1 + 0 && 0 != INPUTS_at_24[0])));__VERIFIER_assume(!((0 != INPUTS_at_24[1] && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 2 && INPUTS_at_24[0]- 2 < 1 + 0 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_15[0])));__VERIFIER_assume(!((0 == INPUTS_at_24[2] && 0 < 1 + INPUTS_at_24[1]- 3 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[2])));__VERIFIER_assume(!((0 == INPUTS_at_24[3] && 0 < 1 + INPUTS_at_24[2]- 4 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[3])));__VERIFIER_assume(!((0 == INPUTS_at_24[4] && 0 < 1 + INPUTS_at_24[3]- 5 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[4])));__VERIFIER_assume(!((0 == INPUTS_at_24[5] && 0 < 1 + INPUTS_at_24[4]- 6 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[5])));__VERIFIER_assume(!((0 == INPUTS_at_24[6] && 0 < 1 + INPUTS_at_24[5]- 7 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[6])));__VERIFIER_error();  
30
}  
31
  }  
32
  if (!(x==0)) {  
33
  __VERIFIER_assume(!((0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && 0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && INPUTS_at_15[0]- 1 < 1 + 0 && 0 != INPUTS_at_24[0])));__VERIFIER_assume(!((0 != INPUTS_at_24[1] && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 2 && INPUTS_at_24[0]- 2 < 1 + 0 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_15[0])));__VERIFIER_assume(!((0 == INPUTS_at_24[2] && 0 < 1 + INPUTS_at_24[1]- 3 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[2])));__VERIFIER_assume(!((0 == INPUTS_at_24[3] && 0 < 1 + INPUTS_at_24[2]- 4 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[3])));__VERIFIER_assume(!((0 == INPUTS_at_24[4] && 0 < 1 + INPUTS_at_24[3]- 5 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[4])));__VERIFIER_assume(!((0 == INPUTS_at_24[5] && 0 < 1 + INPUTS_at_24[4]- 6 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[5])));__VERIFIER_assume(!((0 == INPUTS_at_24[6] && 0 < 1 + INPUTS_at_24[5]- 7 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[6])));__VERIFIER_error();  
34
}  
35
}  
2017-05-11 12:41:45:920	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 12:41:46:013	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 12:41:48:737	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 12:41:48:793	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 12:41:48:825	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 12:41:49:021	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 12:41:49:717	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 12:41:49:807	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 12:41:49:893	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 12:41:50:198	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 12:41:50:212	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 12:41:50:222	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 12:41:50:242	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 12:41:50:460	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:41:51:195	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:41:51:227	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:41:51:405	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:41:52:395	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 12:41:52:395	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5f3226f4

2017-05-11 12:41:52:395	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:41:54:022	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 12:41:54:023	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5f3226f4

2017-05-11 12:41:54:023	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:41:55:050	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 12:41:55:050	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5f3226f4

2017-05-11 12:41:55:050	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:41:55:896	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 12:41:55:896	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5f3226f4

2017-05-11 12:41:55:897	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:41:56:413	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 12:41:56:414	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5f3226f4

2017-05-11 12:41:56:414	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:41:56:902	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 12:41:56:902	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5f3226f4

2017-05-11 12:41:56:903	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:42:02:140	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:42:03:304	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 12:42:03:305	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:42:03:312	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:42:03:358	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:42:03:381	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:42:05:933	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:42:06:842	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 12:42:06:842	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:42:06:846	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:42:06:847	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:42:06:861	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:42:09:174	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:42:10:705	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 12:42:10:706	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:42:10:710	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:42:10:711	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:42:10:728	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:42:13:411	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:42:15:394	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 12:42:15:394	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:42:15:399	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:42:15:399	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:42:15:419	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:42:19:181	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:42:21:878	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 12:42:21:878	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:42:21:882	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:42:21:883	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:42:21:910	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:42:25:785	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:42:29:707	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

2017-05-11 12:42:29:707	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:42:29:712	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:42:29:713	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:42:29:747	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:42:34:224	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:42:38:931	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 8

2017-05-11 12:42:38:931	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:42:39:902	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:42:40:384	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 12:42:41:747	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:42:158	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:42:158	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:42:509	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:42:509	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:42:869	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:42:869	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:43:194	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:43:194	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:43:543	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 12:42:43:543	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:43:895	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:43:895	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:44:222	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:44:222	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:44:597	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 12:42:44:597	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:44:955	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:44:955	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:45:285	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:45:286	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:45:654	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 12:42:45:654	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:46:104	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:46:105	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:46:434	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:46:434	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:46:793	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 12:42:46:794	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:47:157	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:47:158	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:47:491	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:47:491	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:47:854	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 12:42:47:854	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:48:232	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:48:232	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:48:597	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:48:598	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:48:963	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 12:42:48:963	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:49:339	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:49:339	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:42:49:674	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:42:49:678	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 12:42:49:681	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 12:42:49:682	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:            22 (1% 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:         22 (100%)
  Times precision was empty:       22 (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:         1996
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

Max ABE block size:                       217
Number of predicates discovered:          0

Time for post operator:                  1.125s
  Time for path formula creation:        1.124s
Time for strengthen operator:            0.006s
Time for prec operator:                  0.006s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 22)
    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.021s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 128
   Number of created targets for uf: *signed_int is 113



PrecisionBootstrap statistics
-----------------------------
Init. function predicates:                         0
Init. global predicates:                           0
Init. location predicates:                         0

Invariant Generation statistics
-------------------------------

Bounds CPA statistics
---------------------
Bound k:                                           8
Maximum loop iteration reached:                    9


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  19889 (count: 1907, min: 0, max: 15, avg: 10.43)
Number of global variables:                            8263 (count: 1907, min: 0, max: 5, avg: 4.33)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2911
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.025s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                41

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                 2628
Number of deterministic Assumptions:                    482
Level of Determinism:                              18%

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.008s
Automaton transfers with branching:                0
Automaton transfer successors:                         2911 (count: 2933, min: 0, max: 1, avg: 0.99) [0 x 22, 1 x 2911]

CPA algorithm statistics
------------------------
Number of iterations:            1921
Max size of waitlist:            64
Average size of waitlist:        33
Number of computed successors:   2911
Max successors for one state:    2
Number of times merged:          998
Number of times stopped:         998
Number of times breaked:         0

Total time for CPA algorithm:         1.710s (Max:     0.967s)
  Time for choose from waitlist:      0.006s
  Time for precision adjustment:      0.080s
  Time for transfer relation:         1.537s
  Time for merge operator:            0.054s
  Time for stop operator:             0.009s
  Time for adding to reached set:     0.006s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           1.716s
Time for final sat check:                0.483s
Time for error path creation:            1.269s
Time for bounding assertions check:      0.224s
Time for induction formula creation:    30.341s
Time for induction check:               16.821s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         16 (1600%)
Time for counterexample checks:         7.927s
Time for running CBMC:                  7.766s


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.191s
Automaton transfers with branching:                0
Automaton transfer successors:                        11865 (count: 11939, min: 0, max: 1, avg: 0.99) [0 x 74, 1 x 11865]

CPA algorithm statistics
------------------------
Number of iterations:            7909
Max size of waitlist:            34
Average size of waitlist:        21
Number of computed successors:   11865
Max successors for one state:    2
Number of times merged:          3617
Number of times stopped:         5138
Number of times breaked:         0

Total time for CPA algorithm:        58.041s (Max:    52.728s)
  Time for choose from waitlist:      0.053s
  Time for precision adjustment:      0.241s
  Time for transfer relation:         4.638s
  Time for merge operator:           50.908s
  Time for stop operator:             1.866s
  Time for adding to reached set:     0.065s


Other statistics
================

Code Coverage
-----------------------------
  Function coverage:      0.667
  Visited lines:          18
  Total lines:            21
  Line coverage:          0.857
  Visited conditions:     331
  Total conditions:       478
  Condition coverage:     0.692

CPAchecker general statistics
-----------------------------
Number of program locations:     415
Number of CFA edges:             625
Number of relevant variables:    46
Number of functions:             3
Number of loops:                 3
Size of reached set:             1907
  Number of reached locations:   293 (71%)
    Avg states per location:     6
    Max states per location:     9 (at node N100)
  Number of reached functions:   2 (67%)
  Number of partitions:          1907
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       22

Time for analysis setup:          2.693s
  Time for loading CPAs:          0.961s
  Time for loading parser:        0.487s
  Time for CFA construction:      1.163s
    Time for parsing file(s):     0.270s
    Time for AST to CFA:          0.425s
    Time for CFA sanity check:    0.074s
    Time for post-processing:     0.334s
      Time for var class.:        0.207s
    Time for CFA export:          0.711s
Time for Analysis:               60.941s
CPU time for analysis:          157.770s
Time for analyzing result:        0.001s
Total time for CPAchecker:       63.651s
Total CPU time for CPAchecker:  164.720s
Time for statistics:              2.441s

Time for Garbage Collector:       4.112s (in 53 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                450MB (   429 MiB) max;    214MB (   204 MiB) avg;    479MB (   457 MiB) peak
Used non-heap memory:             53MB (    51 MiB) max;     48MB (    46 MiB) avg;     58MB (    55 MiB) peak
Used in PS Old Gen pool:          57MB (    55 MiB) max;     33MB (    32 MiB) avg;     57MB (    55 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    793MB (   756 MiB) avg
Allocated non-heap memory:        55MB (    52 MiB) max;     50MB (    48 MiB) avg
Total process virtual memory:   8366MB (  7979 MiB) max;   8106MB (  7730 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/for_bounded_loop1_false-unreach-call_true-termination/for_bounded_loop1_false-unreach-call_true-termination.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/for_bounded_loop1_false-unreach-call_true-termination/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