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_srvr.blast.09_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_35l3tmy5/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: 64 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 64 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (2%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 63 (98%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 63 Times result was 'false': 59 (94%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 12755 BDD entailment checks: 1211 Number of SMT sat checks: 63 trivial: 0 cached: 0 Max ABE block size: 53 Number of predicates discovered: 71 Number of abstraction locations: 2 Max number of predicates per location: 70 Avg number of predicates per location: 36 Total predicates per abstraction: 3590 Max number of predicates per abstraction: 70 Avg number of predicates per abstraction: 56.98 Number of irrelevant predicates: 7 (0%) Number of preds handled by boolean abs: 3583 (100%) Total number of models for allsat: 1977 Max number of models for allsat: 58 Avg number of models for allsat: 31.38 Number of path formula cache hits: 6537 (25%) Time for post operator: 1.069s Time for path formula creation: 0.995s Actual computation: 0.948s Time for strengthen operator: 0.418s Time for satisfiability checks: 0.381s Time for prec operator: 6.997s Time for abstraction: 6.990s (Max: 0.338s, Count: 64) Boolean abstraction: 5.527s Solving time: 0.989s (Max: 0.075s) Model enumeration time: 3.766s Time for BDD construction: 0.452s (Max: 0.084s) Time for merge operator: 0.373s Time for coverage check: 0.039s Time for BDD entailment checks: 0.024s Total time for SMT solver (w/o itp): 5.136s Number of BDD nodes: 187436 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 22666 (count: 11137, min: 0, max: 14567, avg: 2,04) Time for BDD node cleanup: 0.017s 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.104s Automaton transfers with branching: 0 Automaton transfer successors: 37993 (count: 37993, min: 1, max: 1, avg: 1,00) [1 x 37993] CPA algorithm statistics ------------------------ Number of iterations: 19195 Max size of waitlist: 321 Average size of waitlist: 134 Number of computed successors: 25118 Max successors for one state: 2 Number of times merged: 5772 Number of times stopped: 5773 Number of times breaked: 4 Total time for CPA algorithm: 10.429s (Max: 6.989s) Time for choose from waitlist: 0.072s Time for precision adjustment: 7.105s Time for transfer relation: 2.073s Time for merge operator: 0.617s Time for stop operator: 0.148s Time for adding to reached set: 0.152s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 19 (count: 4, min: 2, max: 9, avg: 4,75) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 2.477s Counterexample analysis: 2.378s (Max: 1.551s, Calls: 4) Refinement sat check: 0.942s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s 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.007s Precision update: 0.003s ARG update: 0.069s Length of refined path (in blocks): 17 (count: 3, min: 3, max: 9, avg: 5,67) Number of affected states: 14 (count: 3, min: 2, max: 8, avg: 4,67) 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: 14 (count: 3, min: 2, max: 8, avg: 4,67) Length (states) of path with itp 'false': 0 (count: 3, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 11 (count: 3, min: 1, max: 7, avg: 3,67) 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.: 2384 Max. size of reached set after ref.: 38 Avg. size of reached set before ref.: 1075.00 Avg. size of reached set after ref.: 28.75 Total time for CEGAR algorithm: 12.918s Time for refinements: 2.484s Average time for refinement: 0.621s Max time for refinement: 1.578s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 Code Coverage ----------------------------- Function coverage: 0,400 Visited lines: 562 Total lines: 591 Line coverage: 0,951 Visited conditions: 200 Total conditions: 208 Condition coverage: 0,962 CPAchecker general statistics ----------------------------- Number of program locations: 385 Number of CFA edges: 486 Number of relevant variables: 31 Number of functions: 5 Number of loops: 1 Size of reached set: 15161 Number of reached locations: 353 (92%) Avg states per location: 42 Max states per location: 49 (at node N25) Number of reached functions: 2 (40%) Number of partitions: 15114 Avg size of partitions: 1 Max size of partitions: 48 (with key [N97 (before lines 1141-1720), Function ssl3_accept called from node N33, stack depth 2 [2396e9d4], stack [main, ssl3_accept]]) Number of target states: 0 Time for analysis setup: 1.806s Time for loading CPAs: 0.409s Time for loading parser: 0.577s Time for CFA construction: 0.772s Time for parsing file(s): 0.345s Time for AST to CFA: 0.183s Time for CFA sanity check: 0.000s Time for post-processing: 0.114s Time for var class.: 0.000s Time for Analysis: 12.927s CPU time for analysis: 23.710s Time for analyzing result: 0.004s Total time for CPAchecker: 14.736s Total CPU time for CPAchecker: 26.670s Time for statistics: 0.195s Time for Garbage Collector: 0.333s (in 8 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 589MB ( 562 MiB) max; 171MB ( 163 MiB) avg; 595MB ( 568 MiB) peak Used non-heap memory: 27MB ( 25 MiB) max; 23MB ( 22 MiB) avg; 27MB ( 26 MiB) peak Used in PS Old Gen pool: 41MB ( 39 MiB) max; 23MB ( 22 MiB) avg; 41MB ( 39 MiB) peak Allocated heap memory: 1266MB ( 1207 MiB) max; 509MB ( 485 MiB) avg Allocated non-heap memory: 27MB ( 26 MiB) max; 25MB ( 24 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".