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_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:25:24,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:25:24,627 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:25:24,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:25:24,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:25:24,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:25:24,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:25:24,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:25:24,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:25:24,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:25:24,647 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:25:24,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:25:24,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:25:24,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:25:24,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:25:24,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:25:24,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:25:24,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:25:24,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:25:24,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:25:24,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:25:24,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:25:24,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:25:24,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:25:24,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:25:24,664 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:25:24,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:25:24,665 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:25:24,665 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:25:24,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:25:24,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:25:24,666 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_imprecise.epf [2018-01-24 16:25:24,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:25:24,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:25:24,677 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:25:24,677 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:25:24,677 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:25:24,678 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:25:24,678 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:25:24,678 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:25:24,679 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:25:24,679 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:25:24,679 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:25:24,679 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:25:24,679 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:25:24,680 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:25:24,680 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:25:24,680 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:25:24,680 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:25:24,680 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:25:24,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:25:24,681 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:25:24,681 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:25:24,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:25:24,681 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:25:24,681 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:25:24,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:25:24,682 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:25:24,682 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:25:24,682 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:25:24,682 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:25:24,683 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:25:24,683 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:25:24,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:25:24,683 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:25:24,684 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:25:24,684 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:25:24,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:25:24,730 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:25:24,734 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:25:24,735 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:25:24,736 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:25:24,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i [2018-01-24 16:25:24,910 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:25:24,916 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:25:24,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:25:24,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:25:24,939 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:25:24,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:25:24" (1/1) ... [2018-01-24 16:25:24,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e562a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:24, skipping insertion in model container [2018-01-24 16:25:24,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:25:24" (1/1) ... [2018-01-24 16:25:24,955 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:25:24,995 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:25:25,123 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:25:25,149 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:25:25,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:25 WrapperNode [2018-01-24 16:25:25,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:25:25,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:25:25,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:25:25,160 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:25:25,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:25" (1/1) ... [2018-01-24 16:25:25,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:25" (1/1) ... [2018-01-24 16:25:25,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:25" (1/1) ... [2018-01-24 16:25:25,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:25" (1/1) ... [2018-01-24 16:25:25,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:25" (1/1) ... [2018-01-24 16:25:25,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:25" (1/1) ... [2018-01-24 16:25:25,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:25" (1/1) ... [2018-01-24 16:25:25,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:25:25,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:25:25,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:25:25,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:25:25,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:25:25" (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 16:25:25,257 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:25:25,257 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:25:25,258 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 16:25:25,258 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-24 16:25:25,258 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-24 16:25:25,258 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-24 16:25:25,258 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-24 16:25:25,258 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-24 16:25:25,258 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-24 16:25:25,258 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-24 16:25:25,258 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 16:25:25,259 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:25:25,260 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:25:25,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:25:25,679 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:25:25,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:25:25 BoogieIcfgContainer [2018-01-24 16:25:25,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:25:25,680 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:25:25,681 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:25:25,681 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:25:25,682 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:25:25" (1/1) ... [2018-01-24 16:25:25,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:25:28,274 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:25:28,313 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:25:28,331 INFO L268 AbstractInterpreter]: Visited 132 different actions 729 times. Merged at 32 different actions 133 times. Never widened. Found 22 fixpoints after 9 different actions. Largest state had 26 variables. [2018-01-24 16:25:28,333 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:25:28,334 INFO L168 Benchmark]: Toolchain (without parser) took 3423.35 ms. Allocated memory was 307.8 MB in the beginning and 483.9 MB in the end (delta: 176.2 MB). Free memory was 267.8 MB in the beginning and 213.6 MB in the end (delta: 54.2 MB). Peak memory consumption was 230.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:25:28,335 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:25:28,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.78 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 255.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:25:28,336 INFO L168 Benchmark]: Boogie Preprocessor took 43.00 ms. Allocated memory is still 307.8 MB. Free memory was 255.7 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:25:28,336 INFO L168 Benchmark]: RCFGBuilder took 476.22 ms. Allocated memory is still 307.8 MB. Free memory was 253.8 MB in the beginning and 222.9 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:25:28,337 INFO L168 Benchmark]: Abstract Interpretation took 2653.18 ms. Allocated memory was 307.8 MB in the beginning and 483.9 MB in the end (delta: 176.2 MB). Free memory was 222.9 MB in the beginning and 213.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 185.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:25:28,338 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.18 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.78 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 255.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.00 ms. Allocated memory is still 307.8 MB. Free memory was 255.7 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 476.22 ms. Allocated memory is still 307.8 MB. Free memory was 253.8 MB in the beginning and 222.9 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2653.18 ms. Allocated memory was 307.8 MB in the beginning and 483.9 MB in the end (delta: 176.2 MB). Free memory was 222.9 MB in the beginning and 213.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 185.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 109 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 950 LocStat_NO_SUPPORTING_DISEQUALITIES : 333 LocStat_NO_DISJUNCTIONS : -218 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 152 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 262 TransStat_NO_SUPPORTING_DISEQUALITIES : 47 TransStat_NO_DISJUNCTIONS : 170 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.613741 RENAME_VARIABLES(MILLISECONDS) : 0.007146 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.288289 PROJECTAWAY(MILLISECONDS) : 1.280901 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002336 DISJOIN(MILLISECONDS) : 0.481372 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.024868 ADD_EQUALITY(MILLISECONDS) : 0.010894 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014502 #CONJOIN_DISJUNCTIVE : 1006 #RENAME_VARIABLES : 2411 #UNFREEZE : 0 #CONJOIN : 1802 #PROJECTAWAY : 1537 #ADD_WEAK_EQUALITY : 64 #DISJOIN : 557 #RENAME_VARIABLES_DISJUNCTIVE : 2199 #ADD_EQUALITY : 283 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 36 - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] FCALL head->prev - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] FCALL head->prev - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] FCALL prev->next = new - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] FCALL prev->next = new - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] FCALL head->next - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND TRUE &now->link != (head) [L658] FCALL now->link.next - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND TRUE &now->link != (head) [L658] FCALL now->link.next - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND TRUE &now->link != (head) [L658] EXPR, FCALL now->link.next [L658] struct top_list *next = ((struct top_list *)((char *)(now->link.next)-(unsigned long)(&((struct top_list *)0)->link))); [L659] CALL destroy_sub(&now->sub1) [L647] FCALL head->next - UnprovableResult [Line: 696]: 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND FALSE, RET !(&now->link != (head)) [L700] destroy_top(&top) [L701] return 0; [L698] FCALL struct list_head top = { &(top), &(top) }; [L701] return 0; - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND TRUE &now->link != (head) [L658] EXPR, FCALL now->link.next [L658] struct top_list *next = ((struct top_list *)((char *)(now->link.next)-(unsigned long)(&((struct top_list *)0)->link))); [L659] CALL destroy_sub(&now->sub1) [L647] EXPR, FCALL head->next [L647] struct sub_list *now = ((struct sub_list *)((char *)(head->next)-(unsigned long)(&((struct sub_list *)0)->link))); [L648] COND TRUE &now->link != (head) [L649] FCALL now->link.next - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND TRUE &now->link != (head) [L658] EXPR, FCALL now->link.next [L658] struct top_list *next = ((struct top_list *)((char *)(now->link.next)-(unsigned long)(&((struct top_list *)0)->link))); [L659] CALL destroy_sub(&now->sub1) [L647] EXPR, FCALL head->next [L647] struct sub_list *now = ((struct sub_list *)((char *)(head->next)-(unsigned long)(&((struct sub_list *)0)->link))); [L648] COND TRUE &now->link != (head) [L649] FCALL now->link.next - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND TRUE &now->link != (head) [L658] EXPR, FCALL now->link.next [L658] struct top_list *next = ((struct top_list *)((char *)(now->link.next)-(unsigned long)(&((struct top_list *)0)->link))); [L659] CALL destroy_sub(&now->sub1) [L647] EXPR, FCALL head->next [L647] struct sub_list *now = ((struct sub_list *)((char *)(head->next)-(unsigned long)(&((struct sub_list *)0)->link))); [L648] COND TRUE &now->link != (head) [L649] EXPR, FCALL now->link.next [L649] struct sub_list *next = ((struct sub_list *)((char *)(now->link.next)-(unsigned long)(&((struct sub_list *)0)->link))); [L650] FCALL free(now) - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND TRUE &now->link != (head) [L658] EXPR, FCALL now->link.next [L658] struct top_list *next = ((struct top_list *)((char *)(now->link.next)-(unsigned long)(&((struct top_list *)0)->link))); [L659] CALL destroy_sub(&now->sub1) [L647] EXPR, FCALL head->next [L647] struct sub_list *now = ((struct sub_list *)((char *)(head->next)-(unsigned long)(&((struct sub_list *)0)->link))); [L648] COND FALSE, RET !(&now->link != (head)) [L659] destroy_sub(&now->sub1) [L660] CALL destroy_sub(&now->sub2) [L647] EXPR, FCALL head->next [L647] struct sub_list *now = ((struct sub_list *)((char *)(head->next)-(unsigned long)(&((struct sub_list *)0)->link))); [L648] COND FALSE, RET !(&now->link != (head)) [L660] destroy_sub(&now->sub2) [L661] FCALL free(now) - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND TRUE &now->link != (head) [L658] EXPR, FCALL now->link.next [L658] struct top_list *next = ((struct top_list *)((char *)(now->link.next)-(unsigned long)(&((struct top_list *)0)->link))); [L659] CALL destroy_sub(&now->sub1) [L647] EXPR, FCALL head->next [L647] struct sub_list *now = ((struct sub_list *)((char *)(head->next)-(unsigned long)(&((struct sub_list *)0)->link))); [L648] COND TRUE &now->link != (head) [L649] EXPR, FCALL now->link.next [L649] struct sub_list *next = ((struct sub_list *)((char *)(now->link.next)-(unsigned long)(&((struct sub_list *)0)->link))); [L650] FCALL free(now) [L651] now = next [L648] COND FALSE, RET !(&now->link != (head)) [L659] destroy_sub(&now->sub1) [L660] CALL destroy_sub(&now->sub2) [L647] FCALL head->next - 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: [L698] FCALL struct list_head top = { &(top), &(top) }; [L699] CALL create_top(&top) [L693] CALL insert_top(top) [L683] EXPR, FCALL malloc(sizeof(*top)) [L683] struct top_list *top = malloc(sizeof(*top)); [L684] COND FALSE !(!top) [L686] CALL create_sub_list(&top->sub1) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L686] create_sub_list(&top->sub1) [L687] CALL create_sub_list(&top->sub2) [L675] FCALL sub->prev = sub [L676] FCALL sub->next = sub [L678] CALL insert_sub(sub) [L667] EXPR, FCALL malloc(sizeof(*sub)) [L667] struct sub_list *sub = malloc(sizeof(*sub)); [L668] COND FALSE !(!sub) [L670] FCALL sub->number = 0 [L671] CALL list_add_tail(&sub->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L671] FCALL list_add_tail(&sub->link, head) [L679] COND FALSE, RET !(__VERIFIER_nondet_int()) [L687] create_sub_list(&top->sub2) [L688] CALL list_add_tail(&top->link, head) [L634] EXPR, FCALL head->prev [L634] CALL __list_add(new, head->prev, head) [L627] FCALL next->prev = new [L628] FCALL new->next = next [L629] FCALL new->prev = prev [L630] RET, FCALL prev->next = new [L634] __list_add(new, head->prev, head) [L688] FCALL list_add_tail(&top->link, head) [L694] COND FALSE, RET !(__VERIFIER_nondet_int()) [L699] create_top(&top) [L700] CALL destroy_top(&top) [L656] EXPR, FCALL head->next [L656] struct top_list *now = ((struct top_list *)((char *)(head->next)-(unsigned long)(&((struct top_list *)0)->link))); [L657] COND TRUE &now->link != (head) [L658] EXPR, FCALL now->link.next [L658] struct top_list *next = ((struct top_list *)((char *)(now->link.next)-(unsigned long)(&((struct top_list *)0)->link))); [L659] CALL destroy_sub(&now->sub1) [L647] EXPR, FCALL head->next [L647] struct sub_list *now = ((struct sub_list *)((char *)(head->next)-(unsigned long)(&((struct sub_list *)0)->link))); [L648] COND FALSE, RET !(&now->link != (head)) [L659] destroy_sub(&now->sub1) [L660] CALL destroy_sub(&now->sub2) [L647] EXPR, FCALL head->next [L647] struct sub_list *now = ((struct sub_list *)((char *)(head->next)-(unsigned long)(&((struct sub_list *)0)->link))); [L648] COND TRUE &now->link != (head) [L649] EXPR, FCALL now->link.next [L649] struct sub_list *next = ((struct sub_list *)((char *)(now->link.next)-(unsigned long)(&((struct sub_list *)0)->link))); [L650] FCALL free(now) [L651] now = next [L648] COND FALSE, RET !(&now->link != (head)) [L660] destroy_sub(&now->sub2) [L661] FCALL free(now) - 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 - 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 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); 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/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-25-28-350.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-25-28-350.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-25-28-350.csv Received shutdown request...