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_false-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_rlcw8ahy/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) Error path found, starting counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Using the following resource limits: CPU-time limit of 900s (CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (CounterexampleCheck:ValueAnalysisCPA:PathFormulaManagerImpl., WARNING) Error path found and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 14 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 14 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (7%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 13 (93%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 14 Times result was 'false': 10 (71%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 1862 BDD entailment checks: 26 Number of SMT sat checks: 14 trivial: 0 cached: 0 Max ABE block size: 46 Number of predicates discovered: 28 Number of abstraction locations: 2 Max number of predicates per location: 27 Avg number of predicates per location: 14 Total predicates per abstraction: 199 Max number of predicates per abstraction: 27 Avg number of predicates per abstraction: 15.31 Number of irrelevant predicates: 1 (1%) Number of preds handled by boolean abs: 198 (99%) Total number of models for allsat: 135 Max number of models for allsat: 56 Avg number of models for allsat: 10.38 Number of path formula cache hits: 2901 (54%) Time for post operator: 0.268s Time for path formula creation: 0.234s Actual computation: 0.248s Time for strengthen operator: 0.077s Time for satisfiability checks: 0.063s Time for prec operator: 1.350s Time for abstraction: 1.344s (Max: 0.337s, Count: 14) Boolean abstraction: 0.906s Solving time: 0.200s (Max: 0.042s) Model enumeration time: 0.582s Time for BDD construction: 0.085s (Max: 0.030s) Time for merge operator: 0.123s Time for coverage check: 0.001s Time for BDD entailment checks: 0.000s Total time for SMT solver (w/o itp): 0.844s Number of BDD nodes: 8713 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 0 (count: 408, min: 0, max: 0, avg: 0,00) Time for BDD node cleanup: 0.001s 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.053s Automaton transfers with branching: 0 Automaton transfer successors: 6848 (count: 6848, min: 1, max: 1, avg: 1,00) [1 x 6848] CPA algorithm statistics ------------------------ Number of iterations: 3310 Max size of waitlist: 65 Average size of waitlist: 30 Number of computed successors: 4348 Max successors for one state: 2 Number of times merged: 918 Number of times stopped: 918 Number of times breaked: 4 Total time for CPA algorithm: 2.358s (Max: 0.980s) Time for choose from waitlist: 0.019s Time for precision adjustment: 1.406s Time for transfer relation: 0.569s Time for merge operator: 0.194s Time for stop operator: 0.036s Time for adding to reached set: 0.063s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 18 (count: 4, min: 2, max: 7, avg: 4,50) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 2.229s Counterexample analysis: 1.894s (Max: 1.223s, Calls: 4) Refinement sat check: 0.722s Interpolant computation: 0.000s Error path post-processing: 0.289s Path-formulas extraction: 0.000s Building the counterexample trace: 0.000s Extracting precise counterexample: 0.289s Extracting infeasible sliced prefixes: 0.000s Selecting infeasible sliced prefixes: 0.000s Predicate creation: 0.003s Precision update: 0.003s ARG update: 0.024s Length of refined path (in blocks): 9 (count: 2, min: 3, max: 6, avg: 4,50) Number of affected states: 7 (count: 2, min: 2, max: 5, avg: 3,50) Length (states) of path with itp 'true': 0 (count: 2, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 7 (count: 2, min: 2, max: 5, avg: 3,50) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 5 (count: 2, min: 1, max: 4, avg: 2,50) Equal non-trivial interpolants along paths: 0 (count: 2, 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: 3 Number of failed refinements: 0 Max. size of reached set before ref.: 1544 Max. size of reached set after ref.: 42 Avg. size of reached set before ref.: 879.00 Avg. size of reached set after ref.: 28.33 Total time for CEGAR algorithm: 4.595s Time for refinements: 2.237s Average time for refinement: 0.559s Max time for refinement: 1.245s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 2.180s Code Coverage ----------------------------- Function coverage: 0,500 Visited lines: 494 Total lines: 523 Line coverage: 0,945 Visited conditions: 168 Total conditions: 174 Condition coverage: 0,966 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: 1544 Number of reached locations: 309 (93%) Avg states per location: 4 Max states per location: 6 (at node N98) Number of reached functions: 2 (50%) Number of partitions: 1539 Avg size of partitions: 1 Max size of partitions: 6 (with key [N98 (before line 1131), Function ssl3_connect called from node N34, stack depth 2 [161add8c], stack [main, ssl3_connect]]) Number of target states: 1 Size of final wait list 46 Time for analysis setup: 1.763s Time for loading CPAs: 0.425s Time for loading parser: 0.571s Time for CFA construction: 0.719s Time for parsing file(s): 0.328s Time for AST to CFA: 0.211s Time for CFA sanity check: 0.000s Time for post-processing: 0.098s Time for var class.: 0.000s Time for Analysis: 6.776s CPU time for analysis: 13.160s Time for analyzing result: 0.000s Total time for CPAchecker: 8.542s Total CPU time for CPAchecker: 16.090s Time for statistics: 0.034s Time for Garbage Collector: 0.130s (in 4 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 163MB ( 156 MiB) max; 75MB ( 72 MiB) avg; 170MB ( 162 MiB) peak Used non-heap memory: 25MB ( 24 MiB) max; 21MB ( 20 MiB) avg; 26MB ( 24 MiB) peak Used in PS Old Gen pool: 26MB ( 25 MiB) max; 14MB ( 13 MiB) avg; 26MB ( 25 MiB) peak Allocated heap memory: 451MB ( 430 MiB) max; 345MB ( 329 MiB) avg Allocated non-heap memory: 26MB ( 25 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 15836MB ( 15103 MiB) max; 15784MB ( 15052 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 1642) found by chosen configuration. More details about the verification run can be found in the directory "./output".