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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 14:44:07,760 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 14:44:07,762 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 14:44:07,776 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 14:44:07,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 14:44:07,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 14:44:07,779 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 14:44:07,780 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 14:44:07,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 14:44:07,783 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 14:44:07,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 14:44:07,784 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 14:44:07,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 14:44:07,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 14:44:07,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 14:44:07,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 14:44:07,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 14:44:07,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 14:44:07,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 14:44:07,796 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 14:44:07,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 14:44:07,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 14:44:07,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 14:44:07,800 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 14:44:07,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 14:44:07,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 14:44:07,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 14:44:07,803 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 14:44:07,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 14:44:07,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 14:44:07,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 14:44:07,804 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.epf [2018-01-24 14:44:07,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 14:44:07,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 14:44:07,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 14:44:07,816 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 14:44:07,816 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 14:44:07,816 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 14:44:07,816 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 14:44:07,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 14:44:07,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 14:44:07,817 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 14:44:07,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 14:44:07,818 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 14:44:07,818 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 14:44:07,818 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 14:44:07,818 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 14:44:07,818 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 14:44:07,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 14:44:07,819 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 14:44:07,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 14:44:07,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 14:44:07,819 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 14:44:07,820 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 14:44:07,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 14:44:07,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 14:44:07,820 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 14:44:07,820 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 14:44:07,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 14:44:07,821 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 14:44:07,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 14:44:07,821 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 14:44:07,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 14:44:07,821 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 14:44:07,822 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 14:44:07,823 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 14:44:07,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 14:44:07,872 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 14:44:07,876 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 14:44:07,878 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 14:44:07,879 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 14:44:07,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-24 14:44:08,077 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 14:44:08,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 14:44:08,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 14:44:08,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 14:44:08,088 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 14:44:08,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c105265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08, skipping insertion in model container [2018-01-24 14:44:08,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,105 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 14:44:08,153 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 14:44:08,295 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 14:44:08,322 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 14:44:08,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08 WrapperNode [2018-01-24 14:44:08,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 14:44:08,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 14:44:08,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 14:44:08,338 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 14:44:08,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 14:44:08,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 14:44:08,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 14:44:08,385 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 14:44:08,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:44:08" (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-24 14:44:08,435 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 14:44:08,435 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 14:44:08,436 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 14:44:08,436 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 14:44:08,436 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 14:44:08,436 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-24 14:44:08,436 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 14:44:08,436 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 14:44:08,437 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 14:44:08,437 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-24 14:44:08,437 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 14:44:08,437 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 14:44:08,437 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 14:44:08,437 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 14:44:08,438 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-24 14:44:08,438 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 14:44:08,438 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 14:44:08,438 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 14:44:08,438 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 14:44:08,438 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 14:44:08,439 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 14:44:08,439 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 14:44:08,439 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 14:44:08,439 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 14:44:08,439 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 14:44:08,440 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 14:44:08,440 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 14:44:08,440 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 14:44:08,440 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 14:44:08,440 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 14:44:08,440 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 14:44:08,441 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 14:44:08,441 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 14:44:08,441 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 14:44:08,441 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 14:44:08,441 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-24 14:44:08,441 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 14:44:08,442 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 14:44:08,442 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 14:44:08,442 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 14:44:08,442 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-24 14:44:08,442 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 14:44:08,442 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 14:44:08,443 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 14:44:08,443 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 14:44:08,443 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-24 14:44:08,443 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 14:44:08,443 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 14:44:08,443 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 14:44:08,443 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 14:44:08,443 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 14:44:08,443 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 14:44:08,444 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 14:44:08,709 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 14:44:08,884 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 14:44:08,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:44:08 BoogieIcfgContainer [2018-01-24 14:44:08,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 14:44:08,885 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 14:44:08,886 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 14:44:08,886 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 14:44:08,887 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:44:08" (1/1) ... [2018-01-24 14:44:08,944 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 14:44:22,560 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 14:44:22,581 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,583 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,584 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 14:44:22,586 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,587 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,589 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,591 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,719 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,722 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,726 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,729 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,732 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,735 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 14:44:22,740 INFO L268 AbstractInterpreter]: Visited 152 different actions 374 times. Merged at 34 different actions 94 times. Never widened. Found 15 fixpoints after 8 different actions. Largest state had 28 variables. [2018-01-24 14:44:22,742 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 14:44:22,743 INFO L168 Benchmark]: Toolchain (without parser) took 14666.08 ms. Allocated memory was 306.7 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 265.7 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 247.5 MB. Max. memory is 5.3 GB. [2018-01-24 14:44:22,744 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 14:44:22,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.14 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 251.6 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-01-24 14:44:22,745 INFO L168 Benchmark]: Boogie Preprocessor took 46.03 ms. Allocated memory is still 306.7 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 14:44:22,745 INFO L168 Benchmark]: RCFGBuilder took 500.59 ms. Allocated memory is still 306.7 MB. Free memory was 249.6 MB in the beginning and 214.7 MB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. [2018-01-24 14:44:22,746 INFO L168 Benchmark]: Abstract Interpretation took 13856.73 ms. Allocated memory was 306.7 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 214.7 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 196.5 MB. Max. memory is 5.3 GB. [2018-01-24 14:44:22,747 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.20 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 256.14 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 251.6 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.03 ms. Allocated memory is still 306.7 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 500.59 ms. Allocated memory is still 306.7 MB. Free memory was 249.6 MB in the beginning and 214.7 MB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 13856.73 ms. Allocated memory was 306.7 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 214.7 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 196.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 133 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 1152 LocStat_NO_SUPPORTING_DISEQUALITIES : 171 LocStat_NO_DISJUNCTIONS : -266 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 192 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 339 TransStat_NO_SUPPORTING_DISEQUALITIES : 36 TransStat_NO_DISJUNCTIONS : 213 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.595560 RENAME_VARIABLES(MILLISECONDS) : 0.002749 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.452348 PROJECTAWAY(MILLISECONDS) : 5.930429 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.120348 DISJOIN(MILLISECONDS) : 0.242566 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.009434 ADD_EQUALITY(MILLISECONDS) : 0.022575 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007503 #CONJOIN_DISJUNCTIVE : 611 #RENAME_VARIABLES : 1525 #UNFREEZE : 0 #CONJOIN : 1421 #PROJECTAWAY : 1225 #ADD_WEAK_EQUALITY : 41 #DISJOIN : 240 #RENAME_VARIABLES_DISJUNCTIVE : 1465 #ADD_EQUALITY : 349 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 33 - 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: 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: 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_get(kobj) [L1373] COND FALSE !(\read(*kobj)) [L1375] RET return kobj; [L1438] ldv_kobject_get(kobj) [L1439] CALL ldv_kobject_put(kobj) [L1361] COND FALSE, RET !(\read(*kobj)) [L1439] 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] 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_get(kobj) [L1373] COND TRUE \read(*kobj) [L1374] CALL ldv_kref_get(&kobj->kref) [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L1255] int temp; [L1256] 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_get(kobj) [L1373] COND TRUE \read(*kobj) [L1374] CALL ldv_kref_get(&kobj->kref) [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L1255] int temp; [L1256] EXPR, FCALL v->counter [L1256] temp = v->counter [L1257] temp += i [L1258] 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_get(kobj) [L1373] COND TRUE \read(*kobj) [L1374] CALL ldv_kref_get(&kobj->kref) [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L1255] int temp; [L1256] EXPR, FCALL v->counter [L1256] temp = v->counter [L1257] temp += i [L1258] FCALL v->counter = temp [L1259] RET return temp; [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) [L1374] ldv_kref_get(&kobj->kref) [L1375] RET return kobj; [L1438] ldv_kobject_get(kobj) [L1439] 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_get(kobj) [L1373] COND TRUE \read(*kobj) [L1374] CALL ldv_kref_get(&kobj->kref) [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L1255] int temp; [L1256] EXPR, FCALL v->counter [L1256] temp = v->counter [L1257] temp += i [L1258] FCALL v->counter = temp [L1259] RET return temp; [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) [L1374] ldv_kref_get(&kobj->kref) [L1375] RET return kobj; [L1438] ldv_kobject_get(kobj) [L1439] 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_get(kobj) [L1373] COND TRUE \read(*kobj) [L1374] CALL ldv_kref_get(&kobj->kref) [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L1255] int temp; [L1256] EXPR, FCALL v->counter [L1256] temp = v->counter [L1257] temp += i [L1258] FCALL v->counter = temp [L1259] RET return temp; [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) [L1374] ldv_kref_get(&kobj->kref) [L1375] RET return kobj; [L1438] ldv_kobject_get(kobj) [L1439] 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_get(kobj) [L1373] COND TRUE \read(*kobj) [L1374] CALL ldv_kref_get(&kobj->kref) [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L1255] int temp; [L1256] EXPR, FCALL v->counter [L1256] temp = v->counter [L1257] temp += i [L1258] FCALL v->counter = temp [L1259] RET return temp; [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) [L1374] ldv_kref_get(&kobj->kref) [L1375] RET return kobj; [L1438] ldv_kobject_get(kobj) [L1439] 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_get(kobj) [L1373] COND TRUE \read(*kobj) [L1374] CALL ldv_kref_get(&kobj->kref) [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L1255] int temp; [L1256] EXPR, FCALL v->counter [L1256] temp = v->counter [L1257] temp += i [L1258] FCALL v->counter = temp [L1259] RET return temp; [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) [L1374] ldv_kref_get(&kobj->kref) [L1375] RET return kobj; [L1438] ldv_kobject_get(kobj) [L1439] 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_get(kobj) [L1373] COND TRUE \read(*kobj) [L1374] CALL ldv_kref_get(&kobj->kref) [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L1255] int temp; [L1256] EXPR, FCALL v->counter [L1256] temp = v->counter [L1257] temp += i [L1258] FCALL v->counter = temp [L1259] RET return temp; [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) [L1374] ldv_kref_get(&kobj->kref) [L1375] RET return kobj; [L1438] ldv_kobject_get(kobj) [L1439] 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_get(kobj) [L1373] COND TRUE \read(*kobj) [L1374] CALL ldv_kref_get(&kobj->kref) [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L1255] int temp; [L1256] EXPR, FCALL v->counter [L1256] temp = v->counter [L1257] temp += i [L1258] FCALL v->counter = temp [L1259] RET return temp; [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) [L1374] ldv_kref_get(&kobj->kref) [L1375] RET return kobj; [L1438] ldv_kobject_get(kobj) [L1439] 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) [L1439] 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]: 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 - 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 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 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_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_14-44-22-760.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_14-44-22-760.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_14-44-22-760.csv Received shutdown request...