Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/sum_non_false-unreach-call_true-termination/sum_non_false-unreach-call_true-termination.over.instr.c

Generated on 2017-05-11 13:44:41 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_13 = 1; int INPUTS_at_13[1]; int input_at_13_counter = 0;int num_of_inputs_at_14 = 1; int INPUTS_at_14[1]; int input_at_14_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_13[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_14[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern int __VERIFIER_nondet_int(void);  
2
extern void __VERIFIER_error();  
3
  
4
int sum(int n, int m) {  
5
    if (n <= 0) {  
6
      return m + n;  
7
    } else {  
8
      return sum(n - 1, m + 1);  
9
    }  
10
}  
11
  
12
int main(void) {initialize_reads();  
13
  int a = (input_at_13_counter < num_of_inputs_at_13) ? INPUTS_at_13[input_at_13_counter++] : __VERIFIER_nondet_int() ;  
14
  int b = (input_at_14_counter < num_of_inputs_at_14) ? INPUTS_at_14[input_at_14_counter++] : __VERIFIER_nondet_int() ;  
15
  int result = sum(a, b);  
16
  if (result == a + b) {  
17
    __VERIFIER_assume(!((INPUTS_at_13[0]<= 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && INPUTS_at_13[0]- 1 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && INPUTS_at_13[0]- 2 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && INPUTS_at_13[0]- 3 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 4 && INPUTS_at_13[0]- 4 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 5 && INPUTS_at_13[0]- 5 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 6 && INPUTS_at_13[0]- 6 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 7 && INPUTS_at_13[0]- 7 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 8 && INPUTS_at_13[0]- 8 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 9 && INPUTS_at_13[0]- 9 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 5 && INPUTS_at_13[0]- 10 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 10)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 4 && INPUTS_at_13[0]- 11 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 9)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 4 && INPUTS_at_13[0]- 12 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 12)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 11 && INPUTS_at_13[0]- 13 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 12 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 13 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 10)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 12 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 14 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 13 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 9 && INPUTS_at_13[0]- 14 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 12 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 9 && INPUTS_at_13[0]- 15 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 15 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 14 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 13)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 14 && 0 < 1 + INPUTS_at_13[0]- 15 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 16 && 0 < 1 + INPUTS_at_13[0]- 12 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 13 && 0 < 1 + INPUTS_at_13[0]- 8 && INPUTS_at_13[0]- 16 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 17 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 16 && 0 < 1 + INPUTS_at_13[0]- 12 && INPUTS_at_13[0]- 17 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 13 && 0 < 1 + INPUTS_at_13[0]- 14 && 0 < 1 + INPUTS_at_13[0]- 15)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 14 && 0 < 1 + INPUTS_at_13[0]- 15 && 0 < 1 + INPUTS_at_13[0]- 12 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 16 && 0 < 1 + INPUTS_at_13[0]- 18 && 0 < 1 + INPUTS_at_13[0]- 17 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 13 && INPUTS_at_13[0]- 18 < 1 + 0)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 19 && 0 < 1 + INPUTS_at_13[0]- 13 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 12 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 11 && INPUTS_at_13[0]- 19 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 16 && 0 < 1 + INPUTS_at_13[0]- 14 && 0 < 1 + INPUTS_at_13[0]- 15 && 0 < 1 + INPUTS_at_13[0]- 18 && 0 < 1 + INPUTS_at_13[0]- 17)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 18 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 12 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 14 && 0 < 1 + INPUTS_at_13[0]- 20 && 0 < 1 + INPUTS_at_13[0]- 15 && 0 < 1 + INPUTS_at_13[0]- 19 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 16 && 0 < 1 + INPUTS_at_13[0]- 13 && INPUTS_at_13[0]- 20 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 17)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 12 && 0 < 1 + INPUTS_at_13[0]- 17 && 0 < 1 + INPUTS_at_13[0]- 19 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 14 && 0 < 1 + INPUTS_at_13[0]- 3 && INPUTS_at_13[0]- 21 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 13 && 0 < 1 + INPUTS_at_13[0]- 15 && 0 < 1 + INPUTS_at_13[0]- 20 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 16 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 18 && 0 < 1 + INPUTS_at_13[0]- 21)));__VERIFIER_assume(!((0 < 1 + INPUTS_at_13[0]- 12 && 0 < 1 + INPUTS_at_13[0]- 2 && 0 < 1 + INPUTS_at_13[0]- 1 && 0 < 1 + INPUTS_at_13[0]- 3 && 0 < 1 + INPUTS_at_13[0]- 21 && 0 < 1 + INPUTS_at_13[0]- 4 && 0 < 1 + INPUTS_at_13[0]- 8 && 0 < 1 + INPUTS_at_13[0]- 11 && 0 < 1 + INPUTS_at_13[0]- 20 && 0 < 1 + INPUTS_at_13[0]- 15 && 0 < 1 + INPUTS_at_13[0]- 7 && 0 < 1 + INPUTS_at_13[0]- 14 && 0 < 1 + INPUTS_at_13[0]- 17 && INPUTS_at_13[0]- 22 < 1 + 0 && 0 < 1 + INPUTS_at_13[0]- 13 && 0 < 1 + INPUTS_at_13[0]- 10 && 0 < 1 + INPUTS_at_13[0]- 19 && 0 < 1 + INPUTS_at_13[0]- 5 && 0 < 1 + INPUTS_at_13[0]- 6 && 0 < 1 + INPUTS_at_13[0]- 9 && 0 < 1 + INPUTS_at_13[0]- 18 && 0 < 1 + INPUTS_at_13[0]- 16 && 0 < 1 + INPUTS_at_13[0]- 22)));__VERIFIER_error();  
18
  }  
19
}  
2017-05-11 13:44:36:189	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 13:44:36:282	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 13:44:38:743	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 13:44:38:770	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 13:44:38:802	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 13:44:39:000	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 13:44:39:551	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 13:44:39:644	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 13:44:39:700	WARNING	Parallel analysis 2:InvariantsCPA:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from sum to sum

2017-05-11 13:44:39:741	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 13:44:39:904	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from sum to sum

2017-05-11 13:44:40:018	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 13:44:40:021	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 13:44:40:056	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 13:44:40:068	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 13:44:40:155	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from sum to sum

2017-05-11 13:44:40:247	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from sum to sum

2017-05-11 13:44:40:333	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from sum to sum

2017-05-11 13:44:40:395	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:44:40:455	INFO	Parallel analysis 2:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Recursion detected, aborting. To ignore recursion, add -skipRecursion to the command line.

2017-05-11 13:44:40:457	WARNING	CallstackTransferRelation.getAbstractSuccessorsForEdge	Warning: Analysis not completed due to recursion (line 8: Unsupported feature (recursion): __CPAchecker_TMP_0 = sum(n - 1, m + 1); (line was originally return sum(n - 1, m + 1);))

2017-05-11 13:44:40:628	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:44:40:631	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 13:44:40:644	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from sum to sum

2017-05-11 13:44:40:681	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 13:44:41:101	INFO	Parallel analysis 1:InductionStepCase:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Recursion detected, aborting. To ignore recursion, add -skipRecursion to the command line.

2017-05-11 13:44:41:103	WARNING	CallstackTransferRelation.getAbstractSuccessorsForEdge	Warning: Analysis not completed due to recursion (line 8: Unsupported feature (recursion): __CPAchecker_TMP_0 = sum(n - 1, m + 1); (line was originally return sum(n - 1, m + 1);))

2017-05-11 13:44:41:104	SEVERE	ParallelAlgorithm.handleFutureResults	Error: Several exceptions occured during the analysis:
 -> line 8: Unsupported feature (recursion): __CPAchecker_TMP_0 = sum(n - 1, m + 1); (line was originally return sum(n - 1, m + 1);)
 -> line 8: Unsupported feature (recursion): __CPAchecker_TMP_0 = sum(n - 1, m + 1); (line was originally return sum(n - 1, m + 1);)

    
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.333
  Visited lines:          0
  Total lines:            10
  Line coverage:          0.000
  Visited conditions:     0
  Total conditions:       608
  Condition coverage:     0.000

CPAchecker general statistics
-----------------------------
Number of program locations:     445
Number of CFA edges:             729
Number of relevant variables:    43
Number of functions:             3
Number of loops:                 2
Size of reached set:             1
  Number of reached locations:   1 (0%)
    Avg states per location:     1
    Max states per location:     1 (at node N26)
  Number of reached functions:   1 (33%)
  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:          2.433s
  Time for loading CPAs:          0.686s
  Time for loading parser:        0.468s
  Time for CFA construction:      1.205s
    Time for parsing file(s):     0.282s
    Time for AST to CFA:          0.422s
    Time for CFA sanity check:    0.083s
    Time for post-processing:     0.320s
      Time for var class.:        0.216s
    Time for CFA export:          0.528s
Time for Analysis:                2.358s
CPU time for analysis:            6.600s
Total time for CPAchecker:        4.805s
Total CPU time for CPAchecker:   12.810s
Time for statistics:              0.025s

Time for Garbage Collector:       0.438s (in 2 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                229MB (   218 MiB) max;    125MB (   119 MiB) avg;    268MB (   256 MiB) peak
Used non-heap memory:             38MB (    36 MiB) max;     30MB (    28 MiB) avg;     39MB (    37 MiB) peak
Used in PS Old Gen pool:          18MB (    18 MiB) max;      7MB (     6 MiB) avg;     18MB (    18 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;   1102MB (  1051 MiB) avg
Allocated non-heap memory:        39MB (    38 MiB) max;     31MB (    30 MiB) avg
Total process virtual memory:   8030MB (  7658 MiB) max;   7869MB (  7505 MiB) avg

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