scripts/cpa.sh -heap 3000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/ssh-simplified/ALL.prp test/programs/benchmarks/ssh-simplified/s3_srvr_2_false-unreach-call.cil.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 3000M. Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.4-svn (OpenJDK 64-Bit Server VM 1.7.0_65) started (CPAchecker.run, INFO) Using predicate analysis with SMTInterpol 2.1-174-ga199d47-comp and JFactory 1.21. (PredicateCPA:PredicateCPA., INFO) Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (PredicateCPA:PredicateCPARefiner., INFO) Starting analysis ... (CPAchecker.runAlgorithm, INFO) 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) Error path found and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 7 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 7 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (14%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 6 (86%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 7 Times result was 'false': 4 (57%) Number of coverage checks: 731 BDD entailment checks: 7 Number of SMT sat checks: 7 trivial: 0 cached: 0 Max ABE block size: 50 Number of predicates discovered: 7 Number of abstraction locations: 2 Max number of predicates per location: 6 Avg number of predicates per location: 4 Total predicates per abstraction: 26 Max number of predicates per abstraction: 6 Avg number of predicates per abstraction: 4.33 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 26 (100%) Total number of models for allsat: 14 Max number of models for allsat: 4 Avg number of models for allsat: 2.33 Number of path formula cache hits: 747 (32%) Time for post operator: 0.292s Time for path formula creation: 0.280s Actual computation: 0.319s Time for strengthen operator: 0.045s Time for satisfiability checks: 0.040s Time for prec operator: 0.888s Time for abstraction: 0.887s (Max: 0.320s, Count: 7) Boolean abstraction: 0.395s Solving time: 0.201s (Max: 0.059s) Model enumeration time: 0.169s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.119s Time for coverage check: 0.001s Time for BDD entailment checks: 0.000s Total time for SMT solver (w/o itp): 0.409s Number of BDD nodes: 268 Size of BDD node table: 10007 Size of BDD node cleanup queue: 34 (count: 82, min: 0, max: 34, avg: 0,41) Time for BDD node cleanup: 0.000s 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.047s Automaton transfers with branching: 0 Automaton transfer successors: 2803 (count: 2803, min: 1, max: 1, avg: 1,00) [1 x 2803] CPA algorithm statistics ------------------------ Number of iterations: 1425 Max size of waitlist: 57 Average size of waitlist: 24 Number of computed successors: 1915 Max successors for one state: 2 Number of times merged: 362 Number of times stopped: 362 Number of times breaked: 3 Total time for CPA algorithm: 1.794s (Max: 1.309s) Time for choose from waitlist: 0.028s Time for precision adjustment: 0.947s Time for transfer relation: 0.550s Time for merge operator: 0.176s Time for stop operator: 0.026s Time for adding to reached set: 0.036s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 10 (count: 3, min: 2, max: 5, avg: 3,33) Time for refinement: 1.197s Counterexample analysis: 0.977s (Max: 0.611s, Calls: 3) Refinement sat check: 0.559s Interpolant computation: 0.177s Error path post-processing: 0.174s Path-formulas extraction: 0.000s Building the counterexample trace: 0.977s Extracting precise counterexample: 0.174s Predicate creation: 0.000s Precision update: 0.001s ARG update: 0.020s Length of refined path (in blocks): 3 (count: 1, min: 3, max: 3, avg: 3,00) Number of affected states: 2 (count: 1, min: 2, max: 2, avg: 2,00) Length (states) of path with itp 'true': 0 (count: 1, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 2 (count: 1, min: 2, max: 2, avg: 2,00) Length (states) of path with itp 'false': 0 (count: 1, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 1 (count: 1, min: 1, max: 1, avg: 1,00) Equal non-trivial interpolants along paths: 0 (count: 1, 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: 3 Number of successful refinements: 2 Number of failed refinements: 0 Max. size of reached set before ref.: 1010 Max. size of reached set after ref.: 70 Avg. size of reached set before ref.: 541.67 Avg. size of reached set after ref.: 35.50 Total time for CEGAR algorithm: 2.996s Time for refinements: 1.202s Average time for refinement: 0.400s Max time for refinement: 0.796s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.782s CPAchecker general statistics ----------------------------- Number of program locations: 358 Number of functions: 2 Number of loops: 1 Size of reached set: 1010 Number of reached locations: 352 (98%) Avg states per location: 2 Max states per location: 4 (at node N114) Number of reached functions: 2 (100%) Number of partitions: 1007 Avg size of partitions: 1 Max size of partitions: 4 (with key [N114 (before lines 118-827), Function ssl3_accept called from node N642, stack depth 2 [60850fc], stack [main, ssl3_accept], Init]) Number of target states: 1 Size of final wait list 54 Time for analysis setup: 1.351s Time for loading CPAs: 0.330s Time for loading parser: 0.417s Time for CFA construction: 0.567s Time for parsing file(s): 0.311s Time for AST to CFA: 0.113s Time for CFA sanity check: 0.000s Time for post-processing: 0.080s Time for var class.: 0.000s Time for Analysis: 3.778s CPU time for analysis: 3.770s Total time for CPAchecker: 5.130s Total CPU time for CPAchecker: 5.110s Time for Garbage Collector: 0.089s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 131MB ( 125 MiB) max; 70MB ( 67 MiB) avg; 150MB ( 143 MiB) peak Used non-heap memory: 23MB ( 22 MiB) max; 19MB ( 18 MiB) avg; 23MB ( 22 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 504MB ( 481 MiB) max; 504MB ( 481 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4967MB ( 4737 MiB) max; 4907MB ( 4680 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 840) found by chosen configuration. More details about the verification run can be found in the directory "./output".