scripts/cpa.sh -heap 3000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -setprop cpa.predicate.handlePointerAliasing=false -64 -timelimit 900s -stats -spec test/programs/benchmarks/ldv-linux-3.4-simple/ALL.prp test/programs/benchmarks/ldv-linux-3.4-simple/32_1_cilled_true-unreach-call_ok_nondet_linux-3.4-32_1-drivers--hwmon--emc1403.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.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) line 2572: Dead code detected: tmp___0 = (int )_kstrtoul(s, base, res); (CFACreationUtils.addEdgeToCFA, INFO) line 2580: Dead code detected: tmp___0 = (int )_kstrtoul(s, base, res); (CFACreationUtils.addEdgeToCFA, INFO) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (PredicateCPA:PathFormulaManagerImpl., WARNING) 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) The following configuration options were specified but are not used: cpa.predicate.memoryAllocationsAlwaysSucceed cpa.predicate.maxPreFilledAllocationSize (CPAchecker.printConfigurationWarnings, WARNING) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Assuming external function ldv_initialize to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function i2c_smbus_read_byte_data to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function strlcpy to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_get_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function hwmon_device_unregister to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function sysfs_remove_group to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function ldv_check_return_value to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_set_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __mutex_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, 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) Assuming external function sysfs_create_group to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_warn to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function hwmon_device_register to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _dev_info to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 3 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 3 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (33%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 2 (67%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 2 Times result was 'false': 1 (50%) Number of coverage checks: 57 BDD entailment checks: 1 Number of SMT sat checks: 2 trivial: 0 cached: 0 Max ABE block size: 53 Number of predicates discovered: 2 Number of abstraction locations: 0 Max number of predicates per location: 0 Avg number of predicates per location: 0 Total predicates per abstraction: 4 Max number of predicates per abstraction: 2 Avg number of predicates per abstraction: 2.00 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 4 (100%) Total number of models for allsat: 2 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 189 (50%) Time for post operator: 0.040s Time for path formula creation: 0.039s Actual computation: 0.038s Time for strengthen operator: 0.119s Time for satisfiability checks: 0.116s Time for prec operator: 0.151s Time for abstraction: 0.151s (Max: 0.140s, Count: 3) Boolean abstraction: 0.057s Solving time: 0.046s (Max: 0.046s) Model enumeration time: 0.003s Time for BDD construction: 0.001s (Max: 0.001s) Time for merge operator: 0.060s Time for coverage check: 0.002s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 0.165s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 17, min: 0, max: 0, avg: 0,00) 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.024s Automaton transfers with branching: 0 Automaton transfer successors: 1737 (count: 1737, min: 1, max: 1, avg: 1,00) [1 x 1737] CPA algorithm statistics ------------------------ Number of iterations: 324 Max size of waitlist: 8 Average size of waitlist: 5 Number of computed successors: 356 Max successors for one state: 2 Number of times merged: 28 Number of times stopped: 29 Number of times breaked: 1 Total time for CPA algorithm: 0.454s (Max: 0.243s) Time for choose from waitlist: 0.002s Time for precision adjustment: 0.160s Time for transfer relation: 0.209s Time for merge operator: 0.062s Time for stop operator: 0.004s Time for adding to reached set: 0.004s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 2 (count: 1, min: 2, max: 2, avg: 2,00) Time for refinement: 0.060s Counterexample analysis: 0.052s (Max: 0.052s, Calls: 1) Refinement sat check: 0.049s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.052s Extracting precise counterexample: 0.000s Predicate creation: 0.000s Precision update: 0.000s ARG update: 0.000s Length of refined path (in blocks): 0 (count: 0, min: 0, max: 0, avg: 0,00) 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) 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: 1 Number of successful refinements: 1 Number of failed refinements: 0 Max. size of reached set before ref.: 163 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 163.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 0.517s Time for refinements: 0.063s Average time for refinement: 0.063s Max time for refinement: 0.063s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 361 Number of functions: 30 Number of loops: 1 Size of reached set: 166 Number of reached locations: 166 (46%) Avg states per location: 1 Max states per location: 1 (at node N25) Number of reached functions: 13 (43%) Number of partitions: 166 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 2.080s Time for loading CPAs: 0.361s Time for loading parser: 0.453s Time for CFA construction: 1.161s Time for parsing file(s): 0.549s Time for AST to CFA: 0.309s Time for CFA sanity check: 0.000s Time for post-processing: 0.153s Time for var class.: 0.000s Time for Analysis: 0.517s CPU time for analysis: 0.510s Total time for CPAchecker: 2.597s Total CPU time for CPAchecker: 2.600s Time for Garbage Collector: 0.067s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 131MB ( 125 MiB) max; 62MB ( 59 MiB) avg; 151MB ( 144 MiB) peak Used non-heap memory: 21MB ( 20 MiB) max; 14MB ( 14 MiB) avg; 21MB ( 20 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: 4900MB ( 4673 MiB) max; 4899MB ( 4672 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".