scripts/cpa.sh -heap 13000M -noout -disable-java-assertions -setprop cpa.predicate.memoryAllocationsAlwaysSucceed=true -predicateAnalysis-PredAbsRefiner-ABEl -setprop cpa.predicate.handlePointerAliasing=false -timelimit 60s -stats -spec test/programs/benchmarks/ssh/ALL.prp test/programs/benchmarks/ssh/s3_clnt.blast.03_true-unreach-call.i.cil.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 13000M. Running CPAchecker with the following extra VM options: -Djava.io.tmpdir=/tmp/BenchExec_run_zq4qfuew/tmp Using the following resource limits: CPU-time limit of 60s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.4-svn 18912M (OpenJDK 64-Bit Server VM 1.7.0_91) started (CPAchecker.run, INFO) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (PredicateCPA:PathFormulaManagerImpl., WARNING) Using predicate analysis with SMTInterpol 2.1-224-gfd408f2-comp and JFactory 1.21. (PredicateCPA:PredicateCPA., INFO) Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (PredicateCPA:PredicateCPARefiner., INFO) The following configuration options were specified but are not used: cpa.predicate.memoryAllocationsAlwaysSucceed (CPAchecker.printConfigurationWarnings, WARNING) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Program contains array, or pointer (multiple level of indirection), or field (enable handleFieldAccess and handleFieldAliasing) access; analysis is imprecise in case of aliasing. (PredicateCPA:CtoFormulaConverter.makeVariableUnsafe, WARNING) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 29 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 29 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (3%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 28 (97%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 28 Times result was 'false': 24 (86%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 4195 BDD entailment checks: 115 Number of SMT sat checks: 28 trivial: 0 cached: 0 Max ABE block size: 46 Number of predicates discovered: 44 Number of abstraction locations: 2 Max number of predicates per location: 43 Avg number of predicates per location: 22 Total predicates per abstraction: 764 Max number of predicates per abstraction: 43 Avg number of predicates per abstraction: 27.29 Number of irrelevant predicates: 6 (1%) Number of preds handled by boolean abs: 758 (99%) Total number of models for allsat: 2501 Max number of models for allsat: 224 Avg number of models for allsat: 89.32 Number of path formula cache hits: 6081 (59%) Time for post operator: 0.532s Time for path formula creation: 0.465s Actual computation: 0.408s Time for strengthen operator: 0.063s Time for satisfiability checks: 0.054s Time for prec operator: 4.055s Time for abstraction: 4.048s (Max: 0.540s, Count: 29) Boolean abstraction: 3.260s Solving time: 0.371s (Max: 0.079s) Model enumeration time: 2.327s Time for BDD construction: 0.458s (Max: 0.153s) Time for merge operator: 0.212s Time for coverage check: 0.008s Time for BDD entailment checks: 0.005s Total time for SMT solver (w/o itp): 2.752s Number of BDD nodes: 120169 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 5749 (count: 2792, min: 0, max: 4996, avg: 2,06) Time for BDD node cleanup: 0.007s Time for BDD garbage collection: 0.000s (in 0 runs) PrecisionBootstrap statistics ----------------------------- Init. function predicates: 0 Init. global predicates: 0 Init. location predicates: 0 AutomatonAnalysis (SVCOMP) statistics ------------------------------------- Number of states: 1 Total time for successor computation: 0.063s Automaton transfers with branching: 0 Automaton transfer successors: 14253 (count: 14253, min: 1, max: 1, avg: 1,00) [1 x 14253] CPA algorithm statistics ------------------------ Number of iterations: 7107 Max size of waitlist: 101 Average size of waitlist: 40 Number of computed successors: 9279 Max successors for one state: 2 Number of times merged: 2040 Number of times stopped: 2041 Number of times breaked: 4 Total time for CPA algorithm: 5.842s (Max: 2.797s) Time for choose from waitlist: 0.035s Time for precision adjustment: 4.161s Time for transfer relation: 0.964s Time for merge operator: 0.351s Time for stop operator: 0.086s Time for adding to reached set: 0.078s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 20 (count: 4, min: 2, max: 8, avg: 5,00) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 2.051s Counterexample analysis: 1.969s (Max: 1.265s, Calls: 4) Refinement sat check: 0.547s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.001s Building the counterexample trace: 0.000s Extracting precise counterexample: 0.000s Extracting infeasible sliced prefixes: 0.000s Selecting infeasible sliced prefixes: 0.000s Predicate creation: 0.005s Precision update: 0.002s ARG update: 0.050s Length of refined path (in blocks): 18 (count: 3, min: 3, max: 8, avg: 6,00) Number of affected states: 15 (count: 3, min: 2, max: 7, avg: 5,00) Length (states) of path with itp 'true': 0 (count: 3, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 15 (count: 3, min: 2, max: 7, avg: 5,00) Length (states) of path with itp 'false': 0 (count: 3, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 12 (count: 3, min: 1, max: 6, avg: 4,00) Equal non-trivial interpolants along paths: 0 (count: 3, min: 0, max: 0, avg: 0,00) Different precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Equal precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Number of refs with location-based cutoff: 0 CEGAR algorithm statistics -------------------------- Number of refinements: 4 Number of successful refinements: 4 Number of failed refinements: 0 Max. size of reached set before ref.: 1810 Max. size of reached set after ref.: 42 Avg. size of reached set before ref.: 1012.00 Avg. size of reached set after ref.: 31.75 Total time for CEGAR algorithm: 7.914s Time for refinements: 2.071s Average time for refinement: 0.517s Max time for refinement: 1.288s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 Code Coverage ----------------------------- Function coverage: 0,500 Visited lines: 508 Total lines: 523 Line coverage: 0,971 Visited conditions: 170 Total conditions: 174 Condition coverage: 0,977 CPAchecker general statistics ----------------------------- Number of program locations: 334 Number of CFA edges: 419 Number of relevant variables: 30 Number of functions: 4 Number of loops: 1 Size of reached set: 3318 Number of reached locations: 315 (94%) Avg states per location: 10 Max states per location: 12 (at node N25) Number of reached functions: 2 (50%) Number of partitions: 3307 Avg size of partitions: 1 Max size of partitions: 12 (with key [N98 (before line 1131), Function ssl3_connect called from node N34, stack depth 2 [a080b41], stack [main, ssl3_connect]]) Number of target states: 0 Time for analysis setup: 1.761s Time for loading CPAs: 0.419s Time for loading parser: 0.494s Time for CFA construction: 0.801s Time for parsing file(s): 0.326s Time for AST to CFA: 0.202s Time for CFA sanity check: 0.000s Time for post-processing: 0.099s Time for var class.: 0.000s Time for Analysis: 7.919s CPU time for analysis: 14.830s Time for analyzing result: 0.001s Total time for CPAchecker: 9.684s Total CPU time for CPAchecker: 17.750s Time for statistics: 0.053s Time for Garbage Collector: 0.207s (in 6 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 301MB ( 287 MiB) max; 92MB ( 88 MiB) avg; 309MB ( 294 MiB) peak Used non-heap memory: 25MB ( 24 MiB) max; 21MB ( 20 MiB) avg; 25MB ( 24 MiB) peak Used in PS Old Gen pool: 28MB ( 27 MiB) max; 16MB ( 15 MiB) avg; 28MB ( 27 MiB) peak Allocated heap memory: 733MB ( 699 MiB) max; 378MB ( 361 MiB) avg Allocated non-heap memory: 26MB ( 25 MiB) max; 25MB ( 23 MiB) avg Total process virtual memory: 15768MB ( 15038 MiB) max; 15768MB ( 15038 MiB) avg Verification result: TRUE. No property violation found by chosen configuration. More details about the verification run can be found in the directory "./output".