java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 04:47:12,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 04:47:12,480 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 04:47:12,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 04:47:12,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 04:47:12,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 04:47:12,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 04:47:12,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 04:47:12,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 04:47:12,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 04:47:12,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 04:47:12,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 04:47:12,502 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 04:47:12,503 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 04:47:12,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 04:47:12,506 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 04:47:12,508 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 04:47:12,510 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 04:47:12,512 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 04:47:12,513 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 04:47:12,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 04:47:12,516 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 04:47:12,516 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 04:47:12,517 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 04:47:12,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 04:47:12,519 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 04:47:12,520 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 04:47:12,520 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 04:47:12,521 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 04:47:12,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 04:47:12,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 04:47:12,522 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf [2018-01-25 04:47:12,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 04:47:12,532 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 04:47:12,533 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 04:47:12,533 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 04:47:12,534 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 04:47:12,534 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 04:47:12,534 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 04:47:12,534 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 04:47:12,535 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 04:47:12,535 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 04:47:12,535 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 04:47:12,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 04:47:12,536 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 04:47:12,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 04:47:12,536 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 04:47:12,536 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 04:47:12,536 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 04:47:12,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 04:47:12,537 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 04:47:12,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 04:47:12,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 04:47:12,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 04:47:12,538 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 04:47:12,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 04:47:12,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 04:47:12,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 04:47:12,539 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 04:47:12,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 04:47:12,539 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 04:47:12,539 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-25 04:47:12,539 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 04:47:12,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 04:47:12,540 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 04:47:12,541 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 04:47:12,541 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 04:47:12,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 04:47:12,587 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 04:47:12,590 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 04:47:12,591 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 04:47:12,592 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 04:47:12,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i [2018-01-25 04:47:12,791 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 04:47:12,798 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 04:47:12,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 04:47:12,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 04:47:12,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 04:47:12,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 04:47:12" (1/1) ... [2018-01-25 04:47:12,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388a8c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:12, skipping insertion in model container [2018-01-25 04:47:12,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 04:47:12" (1/1) ... [2018-01-25 04:47:12,827 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 04:47:12,880 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 04:47:13,007 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 04:47:13,029 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 04:47:13,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:13 WrapperNode [2018-01-25 04:47:13,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 04:47:13,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 04:47:13,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 04:47:13,041 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 04:47:13,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:13" (1/1) ... [2018-01-25 04:47:13,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:13" (1/1) ... [2018-01-25 04:47:13,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:13" (1/1) ... [2018-01-25 04:47:13,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:13" (1/1) ... [2018-01-25 04:47:13,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:13" (1/1) ... [2018-01-25 04:47:13,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:13" (1/1) ... [2018-01-25 04:47:13,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:13" (1/1) ... [2018-01-25 04:47:13,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 04:47:13,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 04:47:13,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 04:47:13,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 04:47:13,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:47:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 04:47:13,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 04:47:13,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 04:47:13,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 04:47:13,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 04:47:13,135 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 04:47:13,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-25 04:47:13,136 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 04:47:13,137 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 04:47:13,137 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 04:47:13,137 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 04:47:13,137 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 04:47:13,137 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 04:47:13,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 04:47:13,138 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 04:47:13,138 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 04:47:13,138 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 04:47:13,138 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 04:47:13,138 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 04:47:13,139 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 04:47:13,139 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 04:47:13,139 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 04:47:13,139 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 04:47:13,139 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 04:47:13,139 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-25 04:47:13,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-25 04:47:13,140 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 04:47:13,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-25 04:47:13,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-25 04:47:13,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-25 04:47:13,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-25 04:47:13,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-25 04:47:13,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-25 04:47:13,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-25 04:47:13,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-25 04:47:13,141 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 04:47:13,141 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 04:47:13,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 04:47:13,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 04:47:13,397 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 04:47:13,586 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 04:47:13,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 04:47:13 BoogieIcfgContainer [2018-01-25 04:47:13,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 04:47:13,587 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-25 04:47:13,587 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-25 04:47:13,588 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-25 04:47:13,589 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 04:47:13" (1/1) ... [2018-01-25 04:47:13,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 04:47:28,446 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 04:47:28,466 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 04:47:28,469 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,470 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,471 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,472 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,473 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,475 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,478 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,481 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,484 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,487 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-25 04:47:28,492 INFO L268 AbstractInterpreter]: Visited 127 different actions 338 times. Merged at 29 different actions 89 times. Never widened. Found 14 fixpoints after 7 different actions. Largest state had 28 variables. [2018-01-25 04:47:28,494 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-25 04:47:28,495 INFO L168 Benchmark]: Toolchain (without parser) took 15703.39 ms. Allocated memory was 299.9 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 258.9 MB in the beginning and 1.1 GB in the end (delta: -879.9 MB). Peak memory consumption was 151.9 MB. Max. memory is 5.3 GB. [2018-01-25 04:47:28,496 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 04:47:28,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.22 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 244.6 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 5.3 GB. [2018-01-25 04:47:28,497 INFO L168 Benchmark]: Boogie Preprocessor took 39.45 ms. Allocated memory is still 299.9 MB. Free memory was 244.6 MB in the beginning and 242.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 04:47:28,498 INFO L168 Benchmark]: RCFGBuilder took 506.08 ms. Allocated memory is still 299.9 MB. Free memory was 242.6 MB in the beginning and 212.9 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 5.3 GB. [2018-01-25 04:47:28,498 INFO L168 Benchmark]: Abstract Interpretation took 14907.11 ms. Allocated memory was 299.9 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 211.9 MB in the beginning and 1.1 GB in the end (delta: -927.0 MB). Peak memory consumption was 104.8 MB. Max. memory is 5.3 GB. [2018-01-25 04:47:28,500 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 242.22 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 244.6 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.45 ms. Allocated memory is still 299.9 MB. Free memory was 244.6 MB in the beginning and 242.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 506.08 ms. Allocated memory is still 299.9 MB. Free memory was 242.6 MB in the beginning and 212.9 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 14907.11 ms. Allocated memory was 299.9 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 211.9 MB in the beginning and 1.1 GB in the end (delta: -927.0 MB). Peak memory consumption was 104.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 111 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 970 LocStat_NO_SUPPORTING_DISEQUALITIES : 149 LocStat_NO_DISJUNCTIONS : -222 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 161 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 290 TransStat_NO_SUPPORTING_DISEQUALITIES : 32 TransStat_NO_DISJUNCTIONS : 179 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.708205 RENAME_VARIABLES(MILLISECONDS) : 0.003179 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.526246 PROJECTAWAY(MILLISECONDS) : 6.258318 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.216390 DISJOIN(MILLISECONDS) : 0.238415 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.010971 ADD_EQUALITY(MILLISECONDS) : 0.021911 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021715 #CONJOIN_DISJUNCTIVE : 546 #RENAME_VARIABLES : 1389 #UNFREEZE : 0 #CONJOIN : 1288 #PROJECTAWAY : 1108 #ADD_WEAK_EQUALITY : 35 #DISJOIN : 226 #RENAME_VARIABLES_DISJUNCTIVE : 1334 #ADD_EQUALITY : 295 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 29 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) - UnprovableResult [Line: 1443]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND TRUE !kobj [L1410] RET return 0; [L1437] EXPR ldv_kobject_create() [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_put(kobj) [L1361] COND FALSE, RET !(\read(*kobj)) [L1438] ldv_kobject_put(kobj) [L1440] CALL ldv_kobject_put(kobj) [L1361] COND FALSE !(\read(*kobj)) [L1440] FCALL ldv_kobject_put(kobj) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] FCALL ((&kref->refcount)->counter) = (1) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) [L1382] ldv_kref_init(&kobj->kref) [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1099] FCALL list->next = list - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) [L1382] ldv_kref_init(&kobj->kref) [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1099] FCALL list->next = list [L1100] FCALL list->prev = list - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) [L1382] ldv_kref_init(&kobj->kref) [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1099] FCALL list->next = list [L1100] FCALL list->prev = list [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1413] ldv_kobject_init(kobj) [L1414] RET return kobj; [L1437] EXPR ldv_kobject_create() [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_put(kobj) [L1361] COND TRUE \read(*kobj) [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L1313] CALL ldv_kref_sub(kref, 1, release) [L1281] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1264] int temp; [L1265] FCALL v->counter - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) [L1382] ldv_kref_init(&kobj->kref) [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1099] FCALL list->next = list [L1100] FCALL list->prev = list [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1413] ldv_kobject_init(kobj) [L1414] RET return kobj; [L1437] EXPR ldv_kobject_create() [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_put(kobj) [L1361] COND TRUE \read(*kobj) [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L1313] CALL ldv_kref_sub(kref, 1, release) [L1281] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1264] int temp; [L1265] EXPR, FCALL v->counter [L1265] temp = v->counter [L1266] temp -= i [L1267] FCALL v->counter = temp - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) [L1382] ldv_kref_init(&kobj->kref) [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1099] FCALL list->next = list [L1100] FCALL list->prev = list [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1413] ldv_kobject_init(kobj) [L1414] RET return kobj; [L1437] EXPR ldv_kobject_create() [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_put(kobj) [L1361] COND TRUE \read(*kobj) [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L1313] CALL ldv_kref_sub(kref, 1, release) [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1264] int temp; [L1265] EXPR, FCALL v->counter [L1265] temp = v->counter [L1266] temp -= i [L1267] FCALL v->counter = temp [L1268] RET return temp; [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1281] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L1282] CALL release(kref) [L1349] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L1349] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L1350] CALL ldv_kobject_cleanup(kobj) [L1339] FCALL kobj->name - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) [L1382] ldv_kref_init(&kobj->kref) [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1099] FCALL list->next = list [L1100] FCALL list->prev = list [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1413] ldv_kobject_init(kobj) [L1414] RET return kobj; [L1437] EXPR ldv_kobject_create() [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_put(kobj) [L1361] COND TRUE \read(*kobj) [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L1313] CALL ldv_kref_sub(kref, 1, release) [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1264] int temp; [L1265] EXPR, FCALL v->counter [L1265] temp = v->counter [L1266] temp -= i [L1267] FCALL v->counter = temp [L1268] RET return temp; [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1281] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L1282] CALL release(kref) [L1349] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L1349] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L1350] CALL ldv_kobject_cleanup(kobj) [L1339] EXPR, FCALL kobj->name [L1339] char *name = kobj->name; [L1340] FCALL free(kobj) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) [L1382] ldv_kref_init(&kobj->kref) [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1099] FCALL list->next = list [L1100] FCALL list->prev = list [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1413] ldv_kobject_init(kobj) [L1414] RET return kobj; [L1437] EXPR ldv_kobject_create() [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_put(kobj) [L1361] COND TRUE \read(*kobj) [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L1313] CALL ldv_kref_sub(kref, 1, release) [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1264] int temp; [L1265] EXPR, FCALL v->counter [L1265] temp = v->counter [L1266] temp -= i [L1267] FCALL v->counter = temp [L1268] RET return temp; [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1281] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L1282] CALL release(kref) [L1349] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L1349] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L1350] CALL ldv_kobject_cleanup(kobj) [L1339] EXPR, FCALL kobj->name [L1339] char *name = kobj->name; [L1340] FCALL free(kobj) [L1343] COND TRUE \read(*name) [L1344] FCALL free(name) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) [L1382] ldv_kref_init(&kobj->kref) [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1099] FCALL list->next = list [L1100] FCALL list->prev = list [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1413] ldv_kobject_init(kobj) [L1414] RET return kobj; [L1437] EXPR ldv_kobject_create() [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_put(kobj) [L1361] COND TRUE \read(*kobj) [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L1313] CALL ldv_kref_sub(kref, 1, release) [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1264] int temp; [L1265] EXPR, FCALL v->counter [L1265] temp = v->counter [L1266] temp -= i [L1267] FCALL v->counter = temp [L1268] RET return temp; [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1281] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L1282] CALL release(kref) [L1349] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L1349] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L1350] CALL ldv_kobject_cleanup(kobj) [L1339] EXPR, FCALL kobj->name [L1339] char *name = kobj->name; [L1340] FCALL free(kobj) [L1343] COND TRUE \read(*name) [L1344] FCALL free(name) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1408] EXPR ldv_malloc(sizeof(*kobj)) [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) [L1413] CALL ldv_kobject_init(kobj) [L1394] COND FALSE !(!kobj) [L1398] CALL ldv_kobject_init_internal(kobj) [L1380] COND FALSE !(!kobj) [L1382] CALL ldv_kref_init(&kobj->kref) [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) [L1382] ldv_kref_init(&kobj->kref) [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1099] FCALL list->next = list [L1100] FCALL list->prev = list [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) [L1413] ldv_kobject_init(kobj) [L1414] RET return kobj; [L1437] EXPR ldv_kobject_create() [L1437] kobj = ldv_kobject_create() [L1438] CALL ldv_kobject_put(kobj) [L1361] COND TRUE \read(*kobj) [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L1313] CALL, EXPR ldv_kref_sub(kref, 1, release) [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1264] int temp; [L1265] EXPR, FCALL v->counter [L1265] temp = v->counter [L1266] temp -= i [L1267] FCALL v->counter = temp [L1268] RET return temp; [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1281] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L1282] CALL release(kref) [L1349] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L1349] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L1350] CALL ldv_kobject_cleanup(kobj) [L1339] EXPR, FCALL kobj->name [L1339] char *name = kobj->name; [L1340] FCALL free(kobj) [L1343] COND FALSE !(\read(*name)) [L1350] FCALL ldv_kobject_cleanup(kobj) [L1283] RET return 1; [L1313] EXPR ldv_kref_sub(kref, 1, release) [L1313] RET return ldv_kref_sub(kref, 1, release); [L1363] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L1438] ldv_kobject_put(kobj) [L1440] CALL ldv_kobject_put(kobj) [L1361] COND TRUE \read(*kobj) [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L1313] CALL ldv_kref_sub(kref, 1, release) [L1281] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L1264] int temp; [L1265] FCALL v->counter - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-25_04-47-28-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-25_04-47-28-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_04-47-28-511.csv Received shutdown request...