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-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:26:46,363 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:26:46,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:26:46,379 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:26:46,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:26:46,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:26:46,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:26:46,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:26:46,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:26:46,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:26:46,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:26:46,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:26:46,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:26:46,386 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:26:46,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:26:46,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:26:46,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:26:46,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:26:46,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:26:46,396 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:26:46,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:26:46,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:26:46,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:26:46,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:26:46,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:26:46,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:26:46,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:26:46,402 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:26:46,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:26:46,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:26:46,403 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:26:46,404 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:26:46,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:26:46,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:26:46,414 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:26:46,415 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:26:46,415 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:26:46,415 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:26:46,415 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:26:46,415 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:26:46,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:26:46,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:26:46,416 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:26:46,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:26:46,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:26:46,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:26:46,417 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:26:46,417 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:26:46,417 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:26:46,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:26:46,418 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:26:46,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:26:46,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:26:46,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:26:46,419 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:26:46,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:26:46,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:26:46,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:26:46,419 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:26:46,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:26:46,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:26:46,420 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:26:46,420 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:26:46,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:26:46,420 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:26:46,421 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:26:46,421 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:26:46,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:26:46,469 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:26:46,473 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:26:46,475 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:26:46,475 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:26:46,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-01-24 16:26:46,673 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:26:46,680 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:26:46,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:26:46,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:26:46,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:26:46,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:26:46" (1/1) ... [2018-01-24 16:26:46,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb77e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46, skipping insertion in model container [2018-01-24 16:26:46,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:26:46" (1/1) ... [2018-01-24 16:26:46,706 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:26:46,748 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:26:46,864 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:26:46,881 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:26:46,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46 WrapperNode [2018-01-24 16:26:46,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:26:46,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:26:46,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:26:46,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:26:46,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46" (1/1) ... [2018-01-24 16:26:46,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46" (1/1) ... [2018-01-24 16:26:46,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46" (1/1) ... [2018-01-24 16:26:46,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46" (1/1) ... [2018-01-24 16:26:46,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46" (1/1) ... [2018-01-24 16:26:46,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46" (1/1) ... [2018-01-24 16:26:46,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46" (1/1) ... [2018-01-24 16:26:46,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:26:46,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:26:46,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:26:46,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:26:46,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:26:46" (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:26:46,985 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:26:46,985 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:26:46,985 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:26:46,985 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:26:46,985 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:26:46,986 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:26:46,986 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:26:46,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:26:46,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:26:46,986 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:26:46,986 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:26:46,987 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:26:46,987 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 16:26:46,987 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:26:46,987 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:26:46,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:26:46,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:26:47,386 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:26:47,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:26:47 BoogieIcfgContainer [2018-01-24 16:26:47,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:26:47,387 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:26:47,387 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:26:47,387 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:26:47,388 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:26:47" (1/1) ... [2018-01-24 16:26:47,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:26:49,557 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:26:49,589 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:26:49,599 INFO L268 AbstractInterpreter]: Visited 104 different actions 503 times. Merged at 77 different actions 283 times. Widened at 2 different actions 2 times. Found 35 fixpoints after 22 different actions. Largest state had 45 variables. [2018-01-24 16:26:49,602 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:26:49,637 INFO L168 Benchmark]: Toolchain (without parser) took 2963.20 ms. Allocated memory was 306.2 MB in the beginning and 482.9 MB in the end (delta: 176.7 MB). Free memory was 266.2 MB in the beginning and 242.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 200.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:26:49,637 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:26:49,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.01 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 254.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:26:49,638 INFO L168 Benchmark]: Boogie Preprocessor took 40.12 ms. Allocated memory is still 306.2 MB. Free memory was 254.2 MB in the beginning and 252.2 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:26:49,638 INFO L168 Benchmark]: RCFGBuilder took 457.72 ms. Allocated memory is still 306.2 MB. Free memory was 252.2 MB in the beginning and 224.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:26:49,638 INFO L168 Benchmark]: Abstract Interpretation took 2248.63 ms. Allocated memory was 306.2 MB in the beginning and 482.9 MB in the end (delta: 176.7 MB). Free memory was 224.6 MB in the beginning and 242.8 MB in the end (delta: -18.2 MB). Peak memory consumption was 158.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:26:49,639 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.16 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.01 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 254.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.12 ms. Allocated memory is still 306.2 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 457.72 ms. Allocated memory is still 306.2 MB. Free memory was 252.2 MB in the beginning and 224.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2248.63 ms. Allocated memory was 306.2 MB in the beginning and 482.9 MB in the end (delta: 176.7 MB). Free memory was 224.6 MB in the beginning and 242.8 MB in the end (delta: -18.2 MB). Peak memory consumption was 158.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 80 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 818 LocStat_NO_SUPPORTING_DISEQUALITIES : 176 LocStat_NO_DISJUNCTIONS : -160 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 108 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 181 TransStat_NO_SUPPORTING_DISEQUALITIES : 48 TransStat_NO_DISJUNCTIONS : 130 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.593816 RENAME_VARIABLES(MILLISECONDS) : 0.380410 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.447545 PROJECTAWAY(MILLISECONDS) : 0.214795 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001248 DISJOIN(MILLISECONDS) : 0.301454 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.416371 ADD_EQUALITY(MILLISECONDS) : 0.012895 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.029102 #CONJOIN_DISJUNCTIVE : 768 #RENAME_VARIABLES : 1620 #UNFREEZE : 0 #CONJOIN : 1119 #PROJECTAWAY : 874 #ADD_WEAK_EQUALITY : 79 #DISJOIN : 149 #RENAME_VARIABLES_DISJUNCTIVE : 1473 #ADD_EQUALITY : 211 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 40 - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND TRUE __VERIFIER_nondet_int() [L644] EXPR, FCALL malloc(sizeof(struct T)) [L644] y = malloc(sizeof(struct T)) [L645] COND FALSE !(!y) [L647] FCALL x->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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND TRUE __VERIFIER_nondet_int() [L644] EXPR, FCALL malloc(sizeof(struct T)) [L644] y = malloc(sizeof(struct T)) [L645] COND FALSE !(!y) [L647] FCALL x->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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND TRUE __VERIFIER_nondet_int() [L644] EXPR, FCALL malloc(sizeof(struct T)) [L644] y = malloc(sizeof(struct T)) [L645] COND FALSE !(!y) [L647] EXPR, FCALL x->head.next [L647] FCALL y->next = x->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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] FCALL first->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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND TRUE __VERIFIER_nondet_int() [L644] EXPR, FCALL malloc(sizeof(struct T)) [L644] y = malloc(sizeof(struct T)) [L645] COND FALSE !(!y) [L647] EXPR, FCALL x->head.next [L647] FCALL y->next = x->head.next [L648] FCALL y->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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND TRUE __VERIFIER_nondet_int() [L644] EXPR, FCALL malloc(sizeof(struct T)) [L644] y = malloc(sizeof(struct T)) [L645] COND FALSE !(!y) [L647] EXPR, FCALL x->head.next [L647] FCALL y->next = x->head.next [L648] EXPR, FCALL y->next [L648] FCALL y->next->prev = y - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND TRUE __VERIFIER_nondet_int() [L644] EXPR, FCALL malloc(sizeof(struct T)) [L644] y = malloc(sizeof(struct T)) [L645] COND FALSE !(!y) [L647] EXPR, FCALL x->head.next [L647] FCALL y->next = x->head.next [L648] EXPR, FCALL y->next [L648] FCALL y->next->prev = y - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] EXPR, FCALL first->next [L665] first = first->next [L666] FCALL x->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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND TRUE __VERIFIER_nondet_int() [L644] EXPR, FCALL malloc(sizeof(struct T)) [L644] y = malloc(sizeof(struct T)) [L645] COND FALSE !(!y) [L647] EXPR, FCALL x->head.next [L647] FCALL y->next = x->head.next [L648] EXPR, FCALL y->next [L648] FCALL y->next->prev = y [L649] FCALL y->prev = &x->head - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND TRUE __VERIFIER_nondet_int() [L644] EXPR, FCALL malloc(sizeof(struct T)) [L644] y = malloc(sizeof(struct T)) [L645] COND FALSE !(!y) [L647] EXPR, FCALL x->head.next [L647] FCALL y->next = x->head.next [L648] EXPR, FCALL y->next [L648] FCALL y->next->prev = y [L649] FCALL y->prev = &x->head [L650] FCALL y->data = 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND TRUE __VERIFIER_nondet_int() [L644] EXPR, FCALL malloc(sizeof(struct T)) [L644] y = malloc(sizeof(struct T)) [L645] COND FALSE !(!y) [L647] EXPR, FCALL x->head.next [L647] FCALL y->next = x->head.next [L648] EXPR, FCALL y->next [L648] FCALL y->next->prev = y [L649] FCALL y->prev = &x->head [L650] FCALL y->data = 0 [L651] FCALL x->head.next = y - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] EXPR, FCALL first->next [L665] first = first->next [L666] EXPR, FCALL x->head.next [L666] struct T* y = x->head.next; [L667] COND TRUE y != &x->head [L668] struct T* z = y; [L669] FCALL y->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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] EXPR, FCALL first->next [L665] first = first->next [L666] EXPR, FCALL x->head.next [L666] struct T* y = x->head.next; [L667] COND TRUE y != &x->head [L668] struct T* z = y; [L669] FCALL y->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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] EXPR, FCALL first->next [L665] first = first->next [L666] EXPR, FCALL x->head.next [L666] struct T* y = x->head.next; [L667] COND TRUE y != &x->head [L668] struct T* z = y; [L669] EXPR, FCALL y->next [L669] y = y->next [L670] FCALL free(z) - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] EXPR, FCALL first->next [L665] first = first->next [L666] EXPR, FCALL x->head.next [L666] struct T* y = x->head.next; [L667] COND FALSE !(y != &x->head) [L672] FCALL free(x) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] FCALL first->next - UnprovableResult [Line: 620]: 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] EXPR, FCALL first->next [L665] first = first->next [L666] EXPR, FCALL x->head.next [L666] struct T* y = x->head.next; [L667] COND FALSE !(y != &x->head) [L672] FCALL free(x) [L663] COND FALSE !(\read(*first)) [L674] return 0; - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] EXPR, FCALL first->next [L665] first = first->next [L666] EXPR, FCALL x->head.next [L666] struct T* y = x->head.next; [L667] COND TRUE y != &x->head [L668] struct T* z = y; [L669] EXPR, FCALL y->next [L669] y = y->next [L670] FCALL free(z) [L667] COND FALSE !(y != &x->head) [L672] FCALL free(x) - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND FALSE !(!first) [L658] FCALL last->next = x - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND FALSE !(!first) [L658] FCALL last->next = x - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND FALSE !(!first) [L658] FCALL last->next = x [L659] FCALL x->prev = last - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] COND TRUE __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof(struct T2)) [L634] struct T2* x = malloc(sizeof(struct T2)); [L635] COND FALSE !(!x) [L637] FCALL x->next = ((void *)0) [L638] FCALL x->prev = ((void *)0) [L639] FCALL x->head.next = &x->head [L640] FCALL x->head.prev = &x->head [L641] FCALL x->head.data = 0 [L642] struct T* y = ((void *)0); [L643] COND FALSE !(__VERIFIER_nondet_int()) [L654] COND TRUE !first [L655] first = x [L656] last = x [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] EXPR, FCALL first->next [L665] first = first->next [L666] EXPR, FCALL x->head.next [L666] struct T* y = x->head.next; [L667] COND FALSE !(y != &x->head) [L672] FCALL free(x) [L663] COND TRUE \read(*first) [L664] struct T2* x = first; [L665] EXPR, FCALL first->next [L665] first = first->next [L666] EXPR, FCALL x->head.next [L666] struct T* y = x->head.next; [L667] COND FALSE !(y != &x->head) [L672] FCALL free(x) - 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]: 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 * 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-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-26-49-649.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-26-49-649.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-26-49-649.csv Received shutdown request...