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--media--dvb--dvb-usb--dvb-usb-digitv.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 8316: Function pointer *__a with type struct dvb_frontend * (*)(const struct mt352_config *, struct i2c_adapter *) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 8419: Function pointer *__a___0 with type struct dvb_frontend * (*)(const struct nxt6000_config *, struct i2c_adapter *) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 8171: Function pointer *__cil_tmp26 with type int (*)(struct dvb_frontend *, int) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 8579: Function pointer *__a with type struct dvb_frontend * (*)(struct dvb_frontend *, int, struct i2c_adapter *, unsigned int) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) 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) 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 ldv_initialize to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dvb_usb_device_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function memset to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dvb_usb_generic_write to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dvb_usb_generic_rw 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 __symbol_get to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __request_module to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 8579: Ignoring call via function pointer digitv_tuner_attach::__a for which no suitable target was found in line: tmp___11 = (*__a)(__cil_tmp19, 96, __cil_tmp21, 9U); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 8579: Ignoring function call through function pointer *__a: tmp___11 = (*__a)(__cil_tmp19, 96, __cil_tmp21, 9U); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function __symbol_put to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 8316: Ignoring call via function pointer digitv_frontend_attach::__a for which no suitable target was found in line: tmp___11 = (*__a)(__cil_tmp22, __cil_tmp26); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 8316: Ignoring function call through function pointer *__a: tmp___11 = (*__a)(__cil_tmp22, __cil_tmp26); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 8419: Ignoring call via function pointer digitv_frontend_attach::__a___0 for which no suitable target was found in line: tmp___16 = (*__a___0)(__cil_tmp43, __cil_tmp47); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 8419: Ignoring function call through function pointer *__a___0: tmp___16 = (*__a___0)(__cil_tmp43, __cil_tmp47); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function msleep to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 7331: Ignoring call via function pointer mt352_write::__cil_tmp11 for which no suitable target was found in line: r = (*__cil_tmp11)(fe, buf, len); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) Assuming external function dev_get_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 17 (2% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 17 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (6%) Times precision was {false}: 0 (0%) Times result was cached: 1 (6%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 15 (88%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 6 Times result was 'false': 5 (83%) Number of coverage checks: 194 BDD entailment checks: 10 Number of SMT sat checks: 6 trivial: 0 cached: 1 Max ABE block size: 52 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: 30 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: 30 (100%) Total number of models for allsat: 15 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 146 (16%) Time for post operator: 0.392s Time for path formula creation: 0.377s Actual computation: 0.367s Time for strengthen operator: 0.200s Time for satisfiability checks: 0.188s Time for prec operator: 1.746s Time for abstraction: 1.744s (Max: 0.791s, Count: 17) Boolean abstraction: 0.718s Solving time: 0.611s (Max: 0.306s) Model enumeration time: 0.085s Time for BDD construction: 0.003s (Max: 0.001s) Time for merge operator: 0.324s Time for coverage check: 0.000s Time for BDD entailment checks: 0.000s Total time for SMT solver (w/o itp): 0.884s Number of BDD nodes: 204 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 81, 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.064s Automaton transfers with branching: 0 Automaton transfer successors: 4988 (count: 4988, min: 1, max: 1, avg: 1,00) [1 x 4988] CPA algorithm statistics ------------------------ Number of iterations: 769 Max size of waitlist: 14 Average size of waitlist: 9 Number of computed successors: 880 Max successors for one state: 2 Number of times merged: 92 Number of times stopped: 102 Number of times breaked: 1 Total time for CPA algorithm: 2.988s (Max: 2.600s) Time for choose from waitlist: 0.009s Time for precision adjustment: 1.796s Time for transfer relation: 0.777s Time for merge operator: 0.367s Time for stop operator: 0.006s Time for adding to reached set: 0.020s 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.109s Counterexample analysis: 0.090s (Max: 0.090s, Calls: 1) Refinement sat check: 0.082s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.090s 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.: 122 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 122.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 3.102s Time for refinements: 0.113s Average time for refinement: 0.113s Max time for refinement: 0.113s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 431 Number of functions: 28 Number of loops: 5 Size of reached set: 658 Number of reached locations: 349 (81%) Avg states per location: 1 Max states per location: 8 (at node N54) Number of reached functions: 18 (64%) Number of partitions: 658 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 4.236s Time for loading CPAs: 0.697s Time for loading parser: 0.708s Time for CFA construction: 2.776s Time for parsing file(s): 1.370s Time for AST to CFA: 0.892s Time for CFA sanity check: 0.001s Time for post-processing: 0.274s Time for var class.: 0.000s Time for Analysis: 3.103s CPU time for analysis: 3.110s Total time for CPAchecker: 7.340s Total CPU time for CPAchecker: 7.340s Time for Garbage Collector: 0.065s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 135MB ( 129 MiB) max; 83MB ( 80 MiB) avg; 151MB ( 144 MiB) peak Used non-heap memory: 22MB ( 21 MiB) max; 17MB ( 16 MiB) avg; 22MB ( 21 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: 4899MB ( 4672 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".