scripts/cpa.sh -svcomp20-pesco -heap 10000M -stack 2048k -benchmark -timelimit '900 s' -stats -spec ../sv-benchmarks/c/properties/unreach-call.prp ../sv-benchmarks/c/locks/test_locks_12.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 10000M. Running CPAchecker with Java stack of size 2048k. Running CPAchecker with the following extra VM options: -Djava.io.tmpdir=/tmp/BenchExec_run_f5_me9bb/tmp Language C detected and set for analysis (CPAMain.detectFrontendLanguageIfNecessary, INFO) Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.8-svn-1361cf0d98+ / svcomp20-pesco (Java HotSpot(TM) 64-Bit Server VM 1.8.0_202) started (CPAchecker.run, INFO) Parsing CFA from file(s) "../sv-benchmarks/c/locks/test_locks_12.c" (CPAchecker.parse, INFO) Using Restarting Algorithm with predictive execution (CoreComponentsFactory.createAlgorithm, INFO) The following configuration options were specified but are not used: cpa.callstack.unsupportedFunctions termination.violation.witness cpa.predicate.memoryAllocationsAlwaysSucceed cpa.arg.compressWitness cpa.callstack.skipFunctionPointerRecursion counterexample.export.graphml counterexample.export.compressWitness cpa.arg.proofWitness (CPAchecker.printConfigurationWarnings, WARNING) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Using the following resource limits: CPU-time limit of 300s (ResourceLimitChecker.fromConfiguration, INFO) Start precise ranking... This can take some time. (JaccardLabelPredictor.ranking, INFO) Predicted ranking: [PA, KI, VA-NoCegar, VA-Cegar, UNKNOWN, BMC] (JaccardLabelPredictor.ranking, INFO) Loading analysis 1 from file config/components/pesco19--03-predicateAnalysis.properties ... (IntelligentRestartAlgorithm.runImpl, INFO) Using the following resource limits: CPU-time limit of 900s (Analysis1:ResourceLimitChecker.fromConfiguration, INFO) Using predicate analysis with MathSAT5 version 5.5.4 (bd863fede57e) (Feb 21 2019 15:05:40, gmp 6.1.0, gcc 4.8.5, 64-bit, reentrant) and JFactory 1.21. (Analysis1:PredicateCPA:PredicateCPA., INFO) Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (Analysis1:PredicateCPA:PredicateCPARefiner., INFO) Starting analysis 1 ... (IntelligentRestartAlgorithm.runImpl, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) AutomatonAnalysis (SVCOMP) statistics ------------------------------------- Number of states: 1 Total time for successor computation: 0.000s Automaton transfers with branching: 0 Automaton transfer successors: 0.00 (sum: 0, count: 0, min: 0, max: 0) [] Number of states with assumption transitions: 0 Jaccard Oracle statistics ------------------------- Number of algorithms provided: 6 Predicted sequence: [PA, KI, VA-NoCegar, VA-Cegar, UNKNOWN, BMC] Total time for prediction : 8.996s Predictive Restart Algorithm statistics --------------------------------------- Number of algorithms provided: 8 Number of algorithms used: 1 Total time for algorithm 1: 0.914s Jaccard Oracle statistics ------------------------- Number of algorithms provided: 6 Predicted sequence: [PA, KI, VA-NoCegar, VA-Cegar, UNKNOWN, BMC] Total time for prediction : 8.996s PredicateCPA statistics ----------------------- Number of abstractions: 6 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 4 (67%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Because of target state: 2 (33%) Times precision was empty: 3 (50%) Times precision was {false}: 1 (17%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 2 (33%) Times result was 'false': 1 (17%) Number of strengthen sat checks: 0 Number of coverage checks: 142 BDD entailment checks: 2 Number of SMT sat checks: 0 trivial: 0 cached: 0 Max ABE block size: 74 Avg ABE block size: 61.33 (sum: 368, count: 6, min: 37, max: 74) Number of predicates discovered: 12 Number of abstraction locations: 0 Max number of predicates per location: 0 Avg number of predicates per location: 0 Total predicates per abstraction: 36 Max number of predicates per abstraction: 12 Avg number of predicates per abstraction: 12.00 Number of irrelevant predicates: 12 (33%) Number of preds handled by boolean abs: 24 (67%) Total number of models for allsat: 1 Max number of models for allsat: 1 Avg number of models for allsat: 0.50 Time for post operator: 0.090s Time for path formula creation: 0.087s Time for strengthen operator: 0.010s Time for prec operator: 0.072s Time for abstraction: 0.068s (Max: 0.039s, Count: 6) Boolean abstraction: 0.036s Solving time: 0.026s (Max: 0.017s) Model enumeration time: 0.006s Time for BDD construction: 0.001s (Max: 0.001s) Time for merge operator: 0.015s Time for coverage checks: 0.005s Time for BDD entailment checks: 0.005s Total time for SMT solver (w/o itp): 0.032s Number of path formula cache hits: 256 (52%) Inside post operator: Inside path formula creation: Time for path formula computation: 0.088s Total number of created targets for pointer analysis: 0 Number of BDD nodes: 268 Size of BDD node table: 466043 Size of BDD cache: 46619 Size of BDD node cleanup queue: 0.00 (sum: 0, count: 58, min: 0, max: 0) Time for BDD node cleanup: 0.001s Time for BDD garbage collection: 0.000s (in 0 runs) KeyValue statistics ------------------- Init. function predicates: 0 Init. global predicates: 0 Init. location predicates: 0 Invariant Generation statistics ------------------------------- AutomatonAnalysis (SVCOMP) statistics ------------------------------------- Number of states: 1 Total time for successor computation: 0.016s Automaton transfers with branching: 0 Automaton transfer successors: 1.00 (sum: 441, count: 441, min: 1, max: 1) [1 x 441] Number of states with assumption transitions: 0 CPA algorithm statistics ------------------------ Number of iterations: 260 Max size of waitlist: 15 Average size of waitlist: 6 ReversePostorderSortedWaitlist: 0.00 (sum: 0, count: 14, min: 0, max: 0) CallstackSortedWaitlist: 184.50 (sum: 369, count: 2, min: 123, max: 246) Number of computed successors: 333 Max successors for one state: 2 Number of times merged: 70 Number of times stopped: 72 Number of times breaked: 1 Total time for CPA algorithm: 0.287s (Max: 0.179s) Time for choose from waitlist: 0.004s Time for precision adjustment: 0.081s Time for transfer relation: 0.154s Time for merge operator: 0.026s Time for stop operator: 0.012s Time for adding to reached set: 0.005s Static Predicate Refiner statistics ----------------------------------- Number of predicates found statically: 12 (count: 1, min: 12, max: 12, avg: 12.00) Total time for static refinement: 0.058s Time for path feasibility check: 0.016s Time for predicate extraction from CFA: 0.020s Time for ARG update: 0.004s PredicateCPARefiner statistics ------------------------------ Number of predicate refinements: 0 Predicate-Abstraction Refiner statistics ---------------------------------------- Predicate creation: 0.000s Precision update: 0.000s ARG update: 0.000s Length of refined path (in blocks): 0.00 (sum: 0, count: 0, min: 0, max: 0) Number of affected states: 0 (count: 0, min: 0, max: 0, avg: 0.00) Length (states) of path with itp 'true': 0 (count: 0, min: 0, max: 0, avg: 0.00) Length (states) of path with itp non-trivial itp: 0 (count: 0, min: 0, max: 0, avg: 0.00) Length (states) of path with itp 'false': 0 (count: 0, min: 0, max: 0, avg: 0.00) Different non-trivial interpolants along paths: 0 (count: 0, min: 0, max: 0, avg: 0.00) Equal non-trivial interpolants 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 CEGAR refinements: 1 Number of successful refinements: 1 Number of failed refinements: 0 Max. size of reached set before ref.: 130 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 130.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 0.353s Time for refinements: 0.065s Average time for refinement: 0.065s Max time for refinement: 0.065s CPAchecker general statistics ----------------------------- Number of program locations: 187 Number of CFA edges (per node): 223 (count: 187, min: 0, max: 2, avg: 1.19) Number of relevant variables: 25 Number of functions: 1 Number of loops (and loop nodes): 1 (sum: 125, min: 125, max: 125, avg: 125.00) Size of reached set: 132 Number of reached locations: 132 (71%) Avg states per location: 1 Max states per location: 1 (at node N0) Number of reached functions: 1 (100%) Number of partitions: 132 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 1.205s Time for loading CPAs: 0.164s Time for loading parser: 0.335s Time for CFA construction: 0.651s Time for parsing file(s): 0.363s Time for AST to CFA: 0.115s Time for CFA sanity check: 0.001s Time for post-processing: 0.101s Time for function pointers resolving: 0.003s Function calls via function pointers: 0 (count: 1, min: 0, max: 0, avg: 0.00) Instrumented function pointer calls: 0 (count: 1, min: 0, max: 0, avg: 0.00) Function calls with function pointer arguments: 0 (count: 1, min: 0, max: 0, avg: 0.00) Instrumented function pointer arguments: 0 (count: 1, min: 0, max: 0, avg: 0.00) Time for classifying variables: 0.059s Time for collecting variables: 0.024s Time for solving dependencies: 0.000s Time for building hierarchy: 0.001s Time for building classification: 0.034s Time for exporting data: 0.000s Time for Analysis: 9.923s CPU time for analysis: 16.790s Time for analyzing result: 0.001s Total time for CPAchecker: 11.129s Total CPU time for CPAchecker: 18.990s Time for statistics: 0.046s Time for Garbage Collector: 4.614s (in 15 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Verification result: TRUE. No property violation found by chosen configuration. More details about the verification run can be found in the directory "./output".