scripts/cpa.sh -heap 50000M -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_7_cilled_false-unreach-call_const_ok_linux-32_1-drivers--media--video--cpia2--cpia2.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 50000M. 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 4729: Dead code detected: Goto: case_1 (CFACreationUtils.addEdgeToCFA, INFO) line 4734: Dead code detected: Goto: case_2 (CFACreationUtils.addEdgeToCFA, INFO) line 4739: Dead code detected: Goto: case_4 (CFACreationUtils.addEdgeToCFA, INFO) line 4748: Dead code detected: Goto: switch_default (CFACreationUtils.addEdgeToCFA, INFO) Dead code detected: Label case_2 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label case_1 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label switch_default is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label case_4 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label while_break is not reachable. (CFAFunctionBuilder.leave, INFO) Inline assembler ignored, analysis is probably unsound! (CFABuilder.createCFA, WARNING) line 21366: Function pointer *__cil_tmp4 with type void (*)(struct file *, wait_queue_head_t *, struct poll_table_struct *) 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 video_devdata 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 vmalloc_to_page to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __phys_addr to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function remap_pfn_range to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_set_interface to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_kill_urb to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_free_urb to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_control_msg to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function msecs_to_jiffies to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function schedule_timeout_interruptible to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function request_firmware to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function release_firmware to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Recursion detected, aborting. To ignore recursion, add -skipRecursion to the command line. (CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge, INFO) Error: line 30478: Unsupported C feature (recursion): cpia2_usb_change_streaming_alternate(cam, __cil_tmp7); (CallstackTransferRelation.getAbstractSuccessorsForEdge, SEVERE) PredicateCPA statistics ----------------------- Number of abstractions: 11 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 11 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 11 (100%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 0 (0%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 0 Number of coverage checks: 3125 BDD entailment checks: 5 Number of SMT sat checks: 0 trivial: 0 cached: 0 Max ABE block size: 635 Number of predicates discovered: 0 Number of path formula cache hits: 0 (0%) Time for post operator: 0.910s Time for path formula creation: 0.850s Actual computation: 0.815s Time for strengthen operator: 0.014s Time for prec operator: 0.288s Time for abstraction: 0.280s (Max: 0.117s, Count: 11) Solving time: 0.000s (Max: 0.000s) Model enumeration time: 0.000s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 2.979s Time for coverage check: 0.003s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 0.000s Number of BDD nodes: 202 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.200s Automaton transfers with branching: 0 Automaton transfer successors: 36722 (count: 36722, min: 1, max: 1, avg: 1,00) [1 x 36722] CPA algorithm statistics ------------------------ Number of iterations: 6811 Max size of waitlist: 99 Average size of waitlist: 56 Number of computed successors: 8419 Max successors for one state: 2 Number of times merged: 1560 Number of times stopped: 1565 Number of times breaked: 0 Total time for CPA algorithm: 5.064s (Max: 5.064s) Time for choose from waitlist: 0.032s Time for precision adjustment: 0.362s Time for transfer relation: 1.359s Time for merge operator: 3.058s Time for stop operator: 0.053s Time for adding to reached set: 0.060s Predicate-Abstraction Refiner statistics ---------------------------------------- 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: 0 Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 3661 Number of functions: 141 Number of loops: 33 Size of reached set: 6855 Number of reached locations: 1324 (36%) Avg states per location: 5 Max states per location: 58 (at node N5696) Number of reached functions: 40 (28%) Number of partitions: 6855 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Size of final wait list 44 Time for analysis setup: 7.672s Time for loading CPAs: 1.034s Time for loading parser: 0.353s Time for CFA construction: 6.132s Time for parsing file(s): 1.192s Time for AST to CFA: 2.470s Time for CFA sanity check: 0.000s Time for post-processing: 2.296s Time for var class.: 0.000s Time for Analysis: 5.064s CPU time for analysis: 14.910s Total time for CPAchecker: 12.738s Total CPU time for CPAchecker: 32.170s Time for Garbage Collector: 0.500s (in 5 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 1089MB ( 1039 MiB) max; 333MB ( 317 MiB) avg; 1221MB ( 1165 MiB) peak Used non-heap memory: 24MB ( 23 MiB) max; 19MB ( 18 MiB) avg; 25MB ( 24 MiB) peak Used in PS Old Gen pool: 76MB ( 72 MiB) max; 4MB ( 4 MiB) avg; 76MB ( 72 MiB) peak Allocated heap memory: 2553MB ( 2435 MiB) max; 2092MB ( 1995 MiB) avg Allocated non-heap memory: 26MB ( 25 MiB) max; 25MB ( 24 MiB) avg Total process virtual memory: 57061MB ( 54417 MiB) max; 57056MB ( 54413 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".