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-ext2/length_test03_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:27:45,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:27:45,062 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:27:45,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:27:45,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:27:45,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:27:45,079 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:27:45,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:27:45,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:27:45,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:27:45,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:27:45,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:27:45,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:27:45,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:27:45,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:27:45,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:27:45,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:27:45,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:27:45,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:27:45,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:27:45,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:27:45,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:27:45,100 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:27:45,101 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:27:45,102 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:27:45,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:27:45,103 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:27:45,104 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:27:45,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:27:45,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:27:45,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:27:45,105 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:27:45,115 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:27:45,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:27:45,117 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:27:45,117 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:27:45,117 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:27:45,117 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:27:45,118 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:27:45,118 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:27:45,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:27:45,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:27:45,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:27:45,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:27:45,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:27:45,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:27:45,120 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:27:45,120 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:27:45,120 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:27:45,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:27:45,121 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:27:45,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:27:45,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:27:45,121 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:27:45,121 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:27:45,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:27:45,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:27:45,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:27:45,122 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:27:45,122 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:27:45,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:27:45,123 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:27:45,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:27:45,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:27:45,123 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:27:45,124 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:27:45,124 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:27:45,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:27:45,174 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:27:45,177 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:27:45,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:27:45,179 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:27:45,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-01-24 16:27:45,332 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:27:45,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:27:45,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:45,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:27:45,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:27:45,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:45" (1/1) ... [2018-01-24 16:27:45,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e41757a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45, skipping insertion in model container [2018-01-24 16:27:45,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:45" (1/1) ... [2018-01-24 16:27:45,367 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:45,407 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:45,532 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:45,554 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:45,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45 WrapperNode [2018-01-24 16:27:45,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:45,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:27:45,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:27:45,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:27:45,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45" (1/1) ... [2018-01-24 16:27:45,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45" (1/1) ... [2018-01-24 16:27:45,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45" (1/1) ... [2018-01-24 16:27:45,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45" (1/1) ... [2018-01-24 16:27:45,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45" (1/1) ... [2018-01-24 16:27:45,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45" (1/1) ... [2018-01-24 16:27:45,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45" (1/1) ... [2018-01-24 16:27:45,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:27:45,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:27:45,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:27:45,619 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:27:45,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:45" (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:27:45,683 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:27:45,684 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:27:45,684 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 16:27:45,684 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:27:45,684 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:27:45,684 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:27:45,684 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:27:45,685 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:27:45,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:27:45,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:27:45,685 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:27:45,685 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:27:45,685 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-24 16:27:45,686 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:27:45,686 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 16:27:45,686 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:27:45,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:27:45,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:27:46,223 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:27:46,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:46 BoogieIcfgContainer [2018-01-24 16:27:46,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:27:46,225 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:27:46,225 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:27:46,225 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:27:46,226 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:46" (1/1) ... [2018-01-24 16:27:46,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:27:48,495 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:27:48,542 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:27:48,551 INFO L268 AbstractInterpreter]: Visited 141 different actions 528 times. Merged at 58 different actions 172 times. Widened at 1 different actions 1 times. Found 26 fixpoints after 16 different actions. Largest state had 50 variables. [2018-01-24 16:27:48,553 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:27:48,554 INFO L168 Benchmark]: Toolchain (without parser) took 3222.00 ms. Allocated memory was 303.6 MB in the beginning and 502.8 MB in the end (delta: 199.2 MB). Free memory was 263.5 MB in the beginning and 373.2 MB in the end (delta: -109.7 MB). Peak memory consumption was 89.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:48,555 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.6 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:27:48,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.68 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 251.4 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:27:48,555 INFO L168 Benchmark]: Boogie Preprocessor took 55.65 ms. Allocated memory is still 303.6 MB. Free memory was 251.4 MB in the beginning and 249.4 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:27:48,556 INFO L168 Benchmark]: RCFGBuilder took 605.65 ms. Allocated memory is still 303.6 MB. Free memory was 249.4 MB in the beginning and 215.4 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:48,556 INFO L168 Benchmark]: Abstract Interpretation took 2328.64 ms. Allocated memory was 303.6 MB in the beginning and 502.8 MB in the end (delta: 199.2 MB). Free memory was 215.4 MB in the beginning and 373.2 MB in the end (delta: -157.8 MB). Peak memory consumption was 41.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:48,557 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.12 ms. Allocated memory is still 303.6 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.68 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 251.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 55.65 ms. Allocated memory is still 303.6 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 605.65 ms. Allocated memory is still 303.6 MB. Free memory was 249.4 MB in the beginning and 215.4 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2328.64 ms. Allocated memory was 303.6 MB in the beginning and 502.8 MB in the end (delta: 199.2 MB). Free memory was 215.4 MB in the beginning and 373.2 MB in the end (delta: -157.8 MB). Peak memory consumption was 41.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 111 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1392 LocStat_NO_SUPPORTING_DISEQUALITIES : 486 LocStat_NO_DISJUNCTIONS : -222 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 147 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 276 TransStat_NO_SUPPORTING_DISEQUALITIES : 63 TransStat_NO_DISJUNCTIONS : 183 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.545335 RENAME_VARIABLES(MILLISECONDS) : 0.004997 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.307940 PROJECTAWAY(MILLISECONDS) : 1.157381 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002114 DISJOIN(MILLISECONDS) : 0.326026 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.014992 ADD_EQUALITY(MILLISECONDS) : 0.027381 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007747 #CONJOIN_DISJUNCTIVE : 809 #RENAME_VARIABLES : 1775 #UNFREEZE : 0 #CONJOIN : 1372 #PROJECTAWAY : 1033 #ADD_WEAK_EQUALITY : 89 #DISJOIN : 303 #RENAME_VARIABLES_DISJUNCTIVE : 1584 #ADD_EQUALITY : 295 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 50 - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] FCALL head->first - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] FCALL head->first - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] FCALL head->last - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L549] FCALL head->last - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L549] EXPR, FCALL head->last [L549] FCALL node->prev = head->last - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L549] EXPR, FCALL head->last [L549] FCALL node->prev = head->last [L550] FCALL node->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L549] EXPR, FCALL head->last [L549] FCALL node->prev = head->last [L550] FCALL node->next = ((void *)0) [L551] FCALL head->last - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] FCALL node->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L549] EXPR, FCALL head->last [L549] FCALL node->prev = head->last [L550] FCALL node->next = ((void *)0) [L551] EXPR, FCALL head->last [L551] FCALL head->last->next = node - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L549] EXPR, FCALL head->last [L549] FCALL node->prev = head->last [L550] FCALL node->next = ((void *)0) [L551] EXPR, FCALL head->last [L551] FCALL head->last->next = node - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L549] EXPR, FCALL head->last [L549] FCALL node->prev = head->last [L550] FCALL node->next = ((void *)0) [L551] EXPR, FCALL head->last [L551] FCALL head->last->next = node [L552] FCALL head->last = node - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] FCALL list->first - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] FCALL cursor->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] FCALL cursor->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND TRUE cursor != ((void *)0) [L574] FCALL cursor->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] FCALL list2->last - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] FCALL list2->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND TRUE cursor != ((void *)0) [L574] EXPR, FCALL cursor->next [L574] next = cursor->next [L575] FCALL free(cursor) - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] EXPR, FCALL list2->last [L578] cursor = list2->last [L579] FCALL cursor->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] EXPR, FCALL list2->last [L578] cursor = list2->last [L579] FCALL cursor->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND TRUE cursor != ((void *)0) [L574] EXPR, FCALL cursor->next [L574] next = cursor->next [L575] FCALL free(cursor) [L576] cursor = next [L573] COND TRUE cursor != ((void *)0) [L574] FCALL cursor->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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] EXPR, FCALL list2->last [L578] cursor = list2->last [L579] EXPR, FCALL cursor->prev [L579] struct node_t *prev = cursor->prev; [L580] c = 0 [L580] COND TRUE c < 5 [L581] FCALL cursor->prev - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] EXPR, FCALL list2->last [L578] cursor = list2->last [L579] EXPR, FCALL cursor->prev [L579] struct node_t *prev = cursor->prev; [L580] c = 0 [L580] COND FALSE !(c < 5) [L585] cursor = ((void *)0) [L586] prev = ((void *)0) [L587] next = ((void *)0) [L588] FCALL free(list2) [L589] FCALL free(list) - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] EXPR, FCALL list2->last [L578] cursor = list2->last [L579] EXPR, FCALL cursor->prev [L579] struct node_t *prev = cursor->prev; [L580] c = 0 [L580] COND TRUE c < 5 [L581] EXPR, FCALL cursor->prev [L581] prev = cursor->prev [L582] FCALL free(cursor) - UnprovableResult [Line: 554]: 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] EXPR, FCALL list2->last [L578] cursor = list2->last [L579] EXPR, FCALL cursor->prev [L579] struct node_t *prev = cursor->prev; [L580] c = 0 [L580] COND FALSE !(c < 5) [L585] cursor = ((void *)0) [L586] prev = ((void *)0) [L587] next = ((void *)0) [L588] FCALL free(list2) [L589] FCALL free(list) [L590] 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] EXPR, FCALL list2->last [L578] cursor = list2->last [L579] EXPR, FCALL cursor->prev [L579] struct node_t *prev = cursor->prev; [L580] c = 0 [L580] COND TRUE c < 5 [L581] EXPR, FCALL cursor->prev [L581] prev = cursor->prev [L582] FCALL free(cursor) [L583] cursor = prev [L580] c++ [L580] COND TRUE c < 5 [L581] FCALL cursor->prev - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND FALSE !(c < 6) [L571] EXPR, FCALL list->first [L571] struct node_t *cursor = list->first; [L572] EXPR, FCALL cursor->next [L572] struct node_t *next = cursor->next; [L573] COND FALSE !(cursor != ((void *)0)) [L578] EXPR, FCALL list2->last [L578] cursor = list2->last [L579] EXPR, FCALL cursor->prev [L579] struct node_t *prev = cursor->prev; [L580] c = 0 [L580] COND TRUE c < 5 [L581] EXPR, FCALL cursor->prev [L581] prev = cursor->prev [L582] FCALL free(cursor) [L583] cursor = prev [L580] c++ [L580] COND FALSE !(c < 5) [L585] cursor = ((void *)0) [L586] prev = ((void *)0) [L587] next = ((void *)0) [L588] FCALL free(list2) - 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: [L555] EXPR, FCALL malloc(sizeof *list) [L555] struct list_t *list = malloc(sizeof *list); [L556] FCALL list->first = ((void *)0) [L557] FCALL list->last = ((void *)0) [L558] EXPR, FCALL malloc(sizeof *list2) [L558] struct list_t *list2 = malloc(sizeof *list2); [L559] FCALL list2->first = ((void *)0) [L560] FCALL list2->last = ((void *)0) [L561] char userInput; [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L564] append(list, userInput) [L565] COND FALSE !(__VERIFIER_nondet_int()) [L566] int c = 0; [L567] c = 0 [L567] COND TRUE c < 6 [L568] char userInput = __VERIFIER_nondet_char(); [L569] CALL append(list2, userInput) [L540] EXPR, FCALL malloc(sizeof *node) [L540] struct node_t *node = malloc(sizeof *node); [L541] FCALL node->data = input [L542] EXPR, FCALL head->first [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] EXPR, FCALL head->last [L542] head->first == ((void *)0) && head->last == ((void *)0) [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node [L544] FCALL head->last= node [L545] FCALL node->prev = ((void *)0) [L546] RET, FCALL node->next = ((void *)0) [L569] append(list2, userInput) [L567] c++ [L567] COND FALSE !(c < 6) [L571] FCALL list->first - 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]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: 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]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-27-48-568.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-27-48-568.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-27-48-568.csv Received shutdown request...