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

Generated on 2017-05-11 13:23:40 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_26 = 1; int INPUTS_at_26[1]; int input_at_26_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_26[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__));  
2
  
3
/*  
4
 * Recursive computation of fibonacci numbers.  
5
 *   
6
 * Author: Matthias Heizmann  
7
 * Date: 2013-07-13  
8
 *   
9
 */  
10
  
11
extern int __VERIFIER_nondet_int(void);  
12
  
13
  
14
int fibonacci(int n) {  
15
    if (n < 1) {  
16
        return 0;  
17
    } else if (n == 1) {  
18
        return 1;  
19
    } else {  
20
        return fibonacci(n-1) + fibonacci(n-2);  
21
    }  
22
}  
23
  
24
  
25
int main() {initialize_reads();  
26
    int x = (input_at_26_counter < num_of_inputs_at_26) ? INPUTS_at_26[input_at_26_counter++] : __VERIFIER_nondet_int() ;  
27
    int result = fibonacci(x);  
28
    if (x < 8 || result >= 34) {  
29
        return 0;  
30
    } else {  
31
        __VERIFIER_assume(!((0 < 1 + INPUTS_at_26[0]- 3 && 0 < 1 + INPUTS_at_26[0]- 6 && 0 < 1 + INPUTS_at_26[0]- 7 && 0 < 1 + INPUTS_at_26[0]- 1 && 0 < 1 + INPUTS_at_26[0]- 5 && 0 < 1 + INPUTS_at_26[0]- 8 && 0 < 1 + INPUTS_at_26[0]- 4 && 0 < 1 + INPUTS_at_26[0]- 2 && 0 != INPUTS_at_26[0]- 3 && 0 != INPUTS_at_26[0]- 4 && 0 == INPUTS_at_26[0]- 8 && 0 != INPUTS_at_26[0]- 6 && 0 != INPUTS_at_26[0]- 1 && 0 != INPUTS_at_26[0]- 2 && 0 != INPUTS_at_26[0]- 7 && 0 != INPUTS_at_26[0]- 5)));__VERIFIER_error();  
32
    }  
33
}  
34
      
2017-05-11 13:23:36:247	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

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

2017-05-11 13:23:38:216	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 13:23:38:447	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:23:38:563	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:23:39:164	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:23:39:233	WARNING	Parallel analysis 2:InvariantsCPA:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from fibonacci to fibonacci

2017-05-11 13:23:39:265	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:23:39:412	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from fibonacci to fibonacci

2017-05-11 13:23:39:442	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:23:39:444	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:23:39:470	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:23:39:479	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:23:39:541	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from fibonacci to fibonacci

2017-05-11 13:23:39:569	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from fibonacci to fibonacci

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

2017-05-11 13:23:39:618	WARNING	CallstackTransferRelation.getAbstractSuccessorsForEdge	Warning: Analysis not completed due to recursion (line 20: Unsupported feature (recursion): __CPAchecker_TMP_0 = fibonacci(n - 1); (line was originally return fibonacci(n-1) + fibonacci(n-2);))

2017-05-11 13:23:39:633	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from fibonacci to fibonacci

2017-05-11 13:23:39:644	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:23:39:883	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:23:39:885	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 13:23:39:897	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from fibonacci to fibonacci

2017-05-11 13:23:39:911	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

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

2017-05-11 13:23:40:266	WARNING	CallstackTransferRelation.getAbstractSuccessorsForEdge	Warning: Analysis not completed due to recursion (line 20: Unsupported feature (recursion): __CPAchecker_TMP_0 = fibonacci(n - 1); (line was originally return fibonacci(n-1) + fibonacci(n-2);))

2017-05-11 13:23:40:267	SEVERE	ParallelAlgorithm.handleFutureResults	Error: Several exceptions occured during the analysis:
 -> line 20: Unsupported feature (recursion): __CPAchecker_TMP_0 = fibonacci(n - 1); (line was originally return fibonacci(n-1) + fibonacci(n-2);)
 -> line 20: Unsupported feature (recursion): __CPAchecker_TMP_0 = fibonacci(n - 1); (line was originally return fibonacci(n-1) + fibonacci(n-2);)

    
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:            12
  Line coverage:          0.000
  Visited conditions:     0
  Total conditions:       46
  Condition coverage:     0.000

CPAchecker general statistics
-----------------------------
Number of program locations:     69
Number of CFA edges:             96
Number of relevant variables:    15
Number of functions:             3
Number of loops:                 1
Size of reached set:             1
  Number of reached locations:   1 (1%)
    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:          1.854s
  Time for loading CPAs:          0.341s
  Time for loading parser:        0.495s
  Time for CFA construction:      0.941s
    Time for parsing file(s):     0.261s
    Time for AST to CFA:          0.282s
    Time for CFA sanity check:    0.090s
    Time for post-processing:     0.224s
      Time for var class.:        0.148s
    Time for CFA export:          0.135s
Time for Analysis:                2.048s
CPU time for analysis:            4.610s
Total time for CPAchecker:        3.915s
Total CPU time for CPAchecker:    8.170s
Time for statistics:              0.023s

Time for Garbage Collector:       0.462s (in 2 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                208MB (   198 MiB) max;    110MB (   105 MiB) avg;    246MB (   235 MiB) peak
Used non-heap memory:             37MB (    35 MiB) max;     28MB (    26 MiB) avg;     37MB (    35 MiB) peak
Used in PS Old Gen pool:          18MB (    17 MiB) max;      6MB (     6 MiB) avg;     18MB (    17 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;   1103MB (  1052 MiB) avg
Allocated non-heap memory:        37MB (    36 MiB) max;     29MB (    27 MiB) avg
Total process virtual memory:   8030MB (  7658 MiB) max;   7870MB (  7505 MiB) avg

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