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.08_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_sukgysw8/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: 78 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 78 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (1%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 77 (99%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 77 Times result was 'false': 73 (95%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 15394 BDD entailment checks: 1372 Number of SMT sat checks: 77 trivial: 0 cached: 0 Max ABE block size: 53 Number of predicates discovered: 162 Number of abstraction locations: 2 Max number of predicates per location: 161 Avg number of predicates per location: 81 Total predicates per abstraction: 8758 Max number of predicates per abstraction: 161 Avg number of predicates per abstraction: 113.74 Number of irrelevant predicates: 42 (0%) Number of preds handled by boolean abs: 8716 (100%) Total number of models for allsat: 6135 Max number of models for allsat: 584 Avg number of models for allsat: 79.68 Number of path formula cache hits: 12503 (38%) Time for post operator: 1.051s Time for path formula creation: 0.972s Actual computation: 0.890s Time for strengthen operator: 0.180s Time for satisfiability checks: 0.154s Time for prec operator: 11.154s Time for abstraction: 11.135s (Max: 1.014s, Count: 78) Boolean abstraction: 9.305s Solving time: 1.127s (Max: 0.061s) Model enumeration time: 4.664s Time for BDD construction: 3.087s (Max: 0.537s) Time for merge operator: 0.362s Time for coverage check: 0.055s Time for BDD entailment checks: 0.044s Total time for SMT solver (w/o itp): 5.945s Number of BDD nodes: 499785 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 45226 (count: 21224, min: 0, max: 41517, avg: 2,13) Time for BDD node cleanup: 0.021s Time for BDD garbage collection: 0.141s (in 10 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.108s Automaton transfers with branching: 0 Automaton transfer successors: 46088 (count: 46088, min: 1, max: 1, avg: 1,00) [1 x 46088] CPA algorithm statistics ------------------------ Number of iterations: 23087 Max size of waitlist: 327 Average size of waitlist: 127 Number of computed successors: 30375 Max successors for one state: 2 Number of times merged: 7011 Number of times stopped: 7012 Number of times breaked: 4 Total time for CPA algorithm: 14.310s (Max: 8.694s) Time for choose from waitlist: 0.057s Time for precision adjustment: 11.279s Time for transfer relation: 1.816s Time for merge operator: 0.626s Time for stop operator: 0.149s Time for adding to reached set: 0.122s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 32 (count: 4, min: 2, max: 15, avg: 8,00) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 14.104s Counterexample analysis: 13.979s (Max: 10.854s, Calls: 4) Refinement sat check: 2.022s 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.025s Precision update: 0.005s ARG update: 0.061s Length of refined path (in blocks): 30 (count: 3, min: 3, max: 15, avg: 10,00) Number of affected states: 27 (count: 3, min: 2, max: 14, avg: 9,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: 27 (count: 3, min: 2, max: 14, avg: 9,00) Length (states) of path with itp 'false': 0 (count: 3, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 24 (count: 3, min: 1, max: 13, avg: 8,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.: 4162 Max. size of reached set after ref.: 38 Avg. size of reached set before ref.: 2013.00 Avg. size of reached set after ref.: 28.75 Total time for CEGAR algorithm: 28.428s Time for refinements: 14.116s Average time for refinement: 3.529s Max time for refinement: 10.906s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 Code Coverage ----------------------------- Function coverage: 0,400 Visited lines: 564 Total lines: 593 Line coverage: 0,951 Visited conditions: 202 Total conditions: 210 Condition coverage: 0,962 CPAchecker general statistics ----------------------------- Number of program locations: 384 Number of CFA edges: 486 Number of relevant variables: 31 Number of functions: 5 Number of loops: 1 Size of reached set: 15427 Number of reached locations: 352 (92%) Avg states per location: 43 Max states per location: 50 (at node N25) Number of reached functions: 2 (40%) Number of partitions: 15379 Avg size of partitions: 1 Max size of partitions: 49 (with key [N97 (before lines 1141-1721), Function ssl3_accept called from node N33, stack depth 2 [3dc71daa], stack [main, ssl3_accept]]) Number of target states: 0 Time for analysis setup: 1.907s Time for loading CPAs: 0.423s Time for loading parser: 0.550s Time for CFA construction: 0.886s Time for parsing file(s): 0.353s Time for AST to CFA: 0.216s Time for CFA sanity check: 0.000s Time for post-processing: 0.111s Time for var class.: 0.000s Time for Analysis: 28.435s CPU time for analysis: 43.890s Time for analyzing result: 0.005s Total time for CPAchecker: 30.345s Total CPU time for CPAchecker: 46.940s Time for statistics: 0.249s Time for Garbage Collector: 0.475s (in 13 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 2783MB ( 2654 MiB) max; 797MB ( 760 MiB) avg; 2809MB ( 2679 MiB) peak Used non-heap memory: 27MB ( 26 MiB) max; 25MB ( 24 MiB) avg; 28MB ( 26 MiB) peak Used in PS Old Gen pool: 57MB ( 54 MiB) max; 40MB ( 38 MiB) avg; 57MB ( 54 MiB) peak Allocated heap memory: 2929MB ( 2794 MiB) max; 1600MB ( 1526 MiB) avg Allocated non-heap memory: 28MB ( 27 MiB) max; 26MB ( 25 MiB) avg Total process virtual memory: 15770MB ( 15039 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".