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/split_list_test05_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:27:24,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:27:24,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:27:24,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:27:24,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:27:24,366 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:27:24,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:27:24,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:27:24,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:27:24,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:27:24,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:27:24,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:27:24,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:27:24,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:27:24,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:27:24,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:27:24,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:27:24,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:27:24,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:27:24,387 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:27:24,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:27:24,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:27:24,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:27:24,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:27:24,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:27:24,393 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:27:24,393 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:27:24,394 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:27:24,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:27:24,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:27:24,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:27:24,396 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:24,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:27:24,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:27:24,407 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:27:24,407 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:27:24,408 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:27:24,408 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:27:24,408 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:27:24,408 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:27:24,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:27:24,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:27:24,409 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:27:24,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:27:24,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:27:24,410 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:27:24,410 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:27:24,410 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:27:24,410 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:27:24,410 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:27:24,410 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:27:24,411 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:27:24,411 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:27:24,411 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:27:24,411 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:27:24,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:27:24,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:27:24,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:27:24,412 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:27:24,412 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:27:24,412 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:27:24,413 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:27:24,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:27:24,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:27:24,413 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:27:24,414 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:27:24,414 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:27:24,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:27:24,463 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:27:24,467 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:27:24,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:27:24,469 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:27:24,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_false-valid-deref.i [2018-01-24 16:27:24,663 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:27:24,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:27:24,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:24,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:27:24,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:27:24,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:24" (1/1) ... [2018-01-24 16:27:24,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dc00c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:24, skipping insertion in model container [2018-01-24 16:27:24,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:24" (1/1) ... [2018-01-24 16:27:24,700 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:24,743 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:24,866 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:24,894 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:24,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:24 WrapperNode [2018-01-24 16:27:24,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:24,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:27:24,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:27:24,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:27:24,921 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:24" (1/1) ... [2018-01-24 16:27:24,921 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:24" (1/1) ... [2018-01-24 16:27:24,933 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:24" (1/1) ... [2018-01-24 16:27:24,933 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:24" (1/1) ... [2018-01-24 16:27:24,945 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:24" (1/1) ... [2018-01-24 16:27:24,952 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:24" (1/1) ... [2018-01-24 16:27:24,955 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:24" (1/1) ... [2018-01-24 16:27:24,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:27:24,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:27:24,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:27:24,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:27:24,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:24" (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:25,017 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:27:25,018 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:27:25,018 INFO L136 BoogieDeclarations]: Found implementation of procedure containsHead [2018-01-24 16:27:25,018 INFO L136 BoogieDeclarations]: Found implementation of procedure containsBody [2018-01-24 16:27:25,018 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 16:27:25,018 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:27:25,018 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:27:25,018 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:27:25,018 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:27:25,018 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure containsHead [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure containsBody [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 16:27:25,019 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:27:25,020 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:27:25,020 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:27:26,010 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:27:26,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:26 BoogieIcfgContainer [2018-01-24 16:27:26,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:27:26,012 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:27:26,012 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:27:26,012 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:27:26,013 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:26" (1/1) ... [2018-01-24 16:27:26,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:27:34,730 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:27:34,903 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:27:35,173 INFO L268 AbstractInterpreter]: Visited 379 different actions 2528 times. Merged at 104 different actions 574 times. Never widened. Found 115 fixpoints after 42 different actions. Largest state had 60 variables. [2018-01-24 16:27:35,175 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:27:35,176 INFO L168 Benchmark]: Toolchain (without parser) took 10512.01 ms. Allocated memory was 303.6 MB in the beginning and 1.3 GB in the end (delta: 997.7 MB). Free memory was 262.5 MB in the beginning and 127.1 MB in the end (delta: 135.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 16:27:35,176 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:27:35,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.28 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 250.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:35,177 INFO L168 Benchmark]: Boogie Preprocessor took 52.21 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 246.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:35,177 INFO L168 Benchmark]: RCFGBuilder took 1051.04 ms. Allocated memory was 303.6 MB in the beginning and 326.6 MB in the end (delta: 23.1 MB). Free memory was 246.5 MB in the beginning and 285.0 MB in the end (delta: -38.4 MB). Peak memory consumption was 72.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:35,178 INFO L168 Benchmark]: Abstract Interpretation took 9163.37 ms. Allocated memory was 326.6 MB in the beginning and 1.3 GB in the end (delta: 974.7 MB). Free memory was 285.0 MB in the beginning and 127.1 MB in the end (delta: 157.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 16:27:35,179 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.28 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 250.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.21 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 246.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1051.04 ms. Allocated memory was 303.6 MB in the beginning and 326.6 MB in the end (delta: 23.1 MB). Free memory was 246.5 MB in the beginning and 285.0 MB in the end (delta: -38.4 MB). Peak memory consumption was 72.5 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 9163.37 ms. Allocated memory was 326.6 MB in the beginning and 1.3 GB in the end (delta: 974.7 MB). Free memory was 285.0 MB in the beginning and 127.1 MB in the end (delta: 157.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 297 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 4183 LocStat_NO_SUPPORTING_DISEQUALITIES : 1097 LocStat_NO_DISJUNCTIONS : -594 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 389 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 655 TransStat_NO_SUPPORTING_DISEQUALITIES : 134 TransStat_NO_DISJUNCTIONS : 489 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.908147 RENAME_VARIABLES(MILLISECONDS) : 4.447133 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.874231 PROJECTAWAY(MILLISECONDS) : 4.410567 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002409 DISJOIN(MILLISECONDS) : 0.410246 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 4.565679 ADD_EQUALITY(MILLISECONDS) : 0.006304 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005742 #CONJOIN_DISJUNCTIVE : 3390 #RENAME_VARIABLES : 7658 #UNFREEZE : 0 #CONJOIN : 5143 #PROJECTAWAY : 4076 #ADD_WEAK_EQUALITY : 77 #DISJOIN : 1900 #RENAME_VARIABLES_DISJUNCTIVE : 6766 #ADD_EQUALITY : 645 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 122 - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L557] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L557] EXPR, FCALL head->last [L557] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L557] EXPR, FCALL head->last [L557] FCALL node->prev = head->last [L558] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L557] EXPR, FCALL head->last [L557] FCALL node->prev = head->last [L558] FCALL node->next = ((void *)0) [L559] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L557] EXPR, FCALL head->last [L557] FCALL node->prev = head->last [L558] FCALL node->next = ((void *)0) [L559] EXPR, FCALL head->last [L559] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L557] EXPR, FCALL head->last [L557] FCALL node->prev = head->last [L558] FCALL node->next = ((void *)0) [L559] EXPR, FCALL head->last [L559] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L557] EXPR, FCALL head->last [L557] FCALL node->prev = head->last [L558] FCALL node->next = ((void *)0) [L559] EXPR, FCALL head->last [L559] FCALL head->last->next = node [L560] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] FCALL cursor->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] cursor->data == '<' && cursor->next->data == 'h' [L540] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] FCALL cursor->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] FCALL cursor->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] FCALL cursor->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] FCALL cursor->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND TRUE !containsHead(cursor) [L602] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] FCALL cursor->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] FCALL cursor->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND TRUE !containsHead(cursor) [L602] EXPR, FCALL cursor->next [L602] next = cursor->next [L603] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND TRUE counter < 6 [L611] FCALL cursor->next - UnprovableResult [Line: 562]: 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND TRUE !containsHead(cursor) [L602] EXPR, FCALL cursor->next [L602] next = cursor->next [L603] FCALL free(cursor) [L604] COND TRUE cursor == ((void *)0) [L605] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND TRUE counter < 6 [L611] EXPR, FCALL cursor->next [L611] next = cursor->next [L612] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] FCALL cursor->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND TRUE !containsHead(cursor) [L602] EXPR, FCALL cursor->next [L602] next = cursor->next [L603] FCALL free(cursor) [L604] COND FALSE !(cursor == ((void *)0)) [L607] cursor = next [L601] CALL containsHead(cursor) [L540] FCALL cursor->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] FCALL cursor->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] FCALL cursor->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] FCALL cursor->next->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] FCALL cursor->next->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND TRUE counter < 6 [L611] EXPR, FCALL cursor->next [L611] next = cursor->next [L612] FCALL free(cursor) [L613] cursor = next [L610] counter++ [L610] COND TRUE counter < 6 [L611] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] cursor->data == '<' && cursor->next->data == 'b' [L544] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND TRUE counter < 6 [L611] EXPR, FCALL cursor->next [L611] next = cursor->next [L612] FCALL free(cursor) [L613] cursor = next [L610] counter++ [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] FCALL cursor->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] FCALL cursor->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] FCALL cursor->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] EXPR, FCALL cursor->next [L541] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] FCALL cursor->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] FCALL cursor->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] FCALL cursor->next->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] FCALL cursor->next->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->next [L541] FCALL cursor->next->next->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->next [L540] EXPR, FCALL cursor->next->next->next [L540] EXPR, FCALL cursor->next->next->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->data [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L541] EXPR, FCALL cursor->next [L541] EXPR, FCALL cursor->next->next [L541] EXPR, FCALL cursor->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next [L541] EXPR, FCALL cursor->next->next->next->next->next [L541] FCALL cursor->next->next->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] FCALL cursor->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] FCALL cursor->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL, EXPR containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L544-L545] RET return cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>'; [L615] EXPR containsBody(cursor) [L615] COND TRUE !containsBody(cursor) [L616] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] FCALL cursor->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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL, EXPR containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L544-L545] RET return cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>'; [L615] EXPR containsBody(cursor) [L615] COND TRUE !containsBody(cursor) [L616] EXPR, FCALL cursor->next [L616] next = cursor->next [L617] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL, EXPR containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L544-L545] RET return cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>'; [L615] EXPR containsBody(cursor) [L615] COND FALSE !(!containsBody(cursor)) [L620] counter = 0 [L620] COND TRUE counter < 6 [L621] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] FCALL cursor->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] FCALL cursor->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL, EXPR containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L544-L545] RET return cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>'; [L615] EXPR containsBody(cursor) [L615] COND FALSE !(!containsBody(cursor)) [L620] counter = 0 [L620] COND FALSE !(counter < 6) [L625] COND TRUE cursor != ((void *)0) [L626] FCALL cursor->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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL, EXPR containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L544-L545] RET return cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>'; [L615] EXPR containsBody(cursor) [L615] COND FALSE !(!containsBody(cursor)) [L620] counter = 0 [L620] COND TRUE counter < 6 [L621] EXPR, FCALL cursor->next [L621] next = cursor->next [L622] FCALL free(cursor) - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL, EXPR containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L544-L545] RET return cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>'; [L615] EXPR containsBody(cursor) [L615] COND FALSE !(!containsBody(cursor)) [L620] counter = 0 [L620] COND FALSE !(counter < 6) [L625] COND TRUE cursor != ((void *)0) [L626] EXPR, FCALL cursor->next [L626] next = cursor->next [L627] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL, EXPR containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L544-L545] RET return cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>'; [L615] EXPR containsBody(cursor) [L615] COND FALSE !(!containsBody(cursor)) [L620] counter = 0 [L620] COND TRUE counter < 6 [L621] EXPR, FCALL cursor->next [L621] next = cursor->next [L622] FCALL free(cursor) [L623] cursor = next [L620] counter++ [L620] COND TRUE counter < 6 [L621] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL, EXPR containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L544-L545] RET return cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>'; [L615] EXPR containsBody(cursor) [L615] COND FALSE !(!containsBody(cursor)) [L620] counter = 0 [L620] COND FALSE !(counter < 6) [L625] COND TRUE cursor != ((void *)0) [L626] EXPR, FCALL cursor->next [L626] next = cursor->next [L627] FCALL free(cursor) [L628] cursor = next [L625] COND TRUE cursor != ((void *)0) [L626] FCALL cursor->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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL, EXPR containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L544-L545] RET return cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>'; [L615] EXPR containsBody(cursor) [L615] COND FALSE !(!containsBody(cursor)) [L620] counter = 0 [L620] COND FALSE !(counter < 6) [L625] COND TRUE cursor != ((void *)0) [L626] EXPR, FCALL cursor->next [L626] next = cursor->next [L627] FCALL free(cursor) [L628] cursor = next [L625] COND FALSE !(cursor != ((void *)0)) [L630] FCALL free(list) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] FCALL cursor->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] FCALL cursor->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] FCALL cursor->next->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] FCALL cursor->next->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] EXPR, FCALL cursor->next [L545] FCALL cursor->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] FCALL cursor->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] FCALL cursor->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] FCALL cursor->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] FCALL cursor->next->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] FCALL cursor->next->next->next->next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->next [L545] FCALL cursor->next->next->next->next->next->data - 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: [L563] EXPR, FCALL malloc(sizeof *list) [L563] struct list_t *list = malloc(sizeof *list); [L564] FCALL list->first = ((void *)0) [L565] FCALL list->last = ((void *)0) [L566] char userInput; [L568] char userInput = __VERIFIER_nondet_char(); [L569] COND FALSE !((userInput == '<') || (userInput == '>')) [L572] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L572] append(list, userInput) [L573] COND FALSE !(__VERIFIER_nondet_int()) [L574] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L574] append(list, '<') [L575] CALL append(list, 'h') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L575] append(list, 'h') [L576] CALL append(list, 'a') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L576] append(list, 'a') [L577] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L577] append(list, 'd') [L578] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L578] append(list, '>') [L580] char userInput = __VERIFIER_nondet_char(); [L581] COND FALSE !((userInput == '<') || (userInput == '>')) [L584] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L584] append(list, userInput) [L585] COND FALSE !(__VERIFIER_nondet_int()) [L586] CALL append(list, '<') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L586] append(list, '<') [L587] CALL append(list, 'b') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L587] append(list, 'b') [L588] CALL append(list, 'o') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L588] append(list, 'o') [L589] CALL append(list, 'd') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L589] append(list, 'd') [L590] CALL append(list, 'y') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L590] append(list, 'y') [L591] CALL append(list, '>') [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L591] append(list, '>') [L593] char userInput = __VERIFIER_nondet_char(); [L594] COND FALSE !((userInput == '<') || (userInput == '>')) [L597] CALL append(list, userInput) [L548] EXPR, FCALL malloc(sizeof *node) [L548] struct node_t *node = malloc(sizeof *node); [L549] FCALL node->data = input [L550] EXPR, FCALL head->first [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] EXPR, FCALL head->last [L550] head->first == ((void *)0) && head->last == ((void *)0) [L550] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L551] FCALL head->first = node [L552] FCALL head->last= node [L553] FCALL node->prev = ((void *)0) [L554] RET, FCALL node->next = ((void *)0) [L597] append(list, userInput) [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR, FCALL list->first [L599] struct node_t *cursor = list->first; [L600] EXPR, FCALL cursor->next [L600] struct node_t *next = cursor->next; [L601] CALL, EXPR containsHead(cursor) [L540] EXPR, FCALL cursor->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR, FCALL cursor->next [L540] EXPR, FCALL cursor->next->data [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' [L540] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' [L540-L541] EXPR cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>' [L540-L541] RET return cursor->data == '<' && cursor->next->data == 'h' && cursor->next->next->data == 'e' && cursor->next->next->next->data == 'a' && cursor->next->next->next->next->data == 'd' && cursor->next->next->next->next->next->data == '>'; [L601] EXPR containsHead(cursor) [L601] COND FALSE !(!containsHead(cursor)) [L609] int counter = 0; [L610] counter = 0 [L610] COND FALSE !(counter < 6) [L615] CALL containsBody(cursor) [L544] EXPR, FCALL cursor->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544] EXPR, FCALL cursor->next [L544] EXPR, FCALL cursor->next->next [L544] EXPR, FCALL cursor->next->next->next [L544] EXPR, FCALL cursor->next->next->next->data [L544] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->data [L544-L545] EXPR cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' [L544-L545] cursor->data == '<' && cursor->next->data == 'b' && cursor->next->next->data == 'o' && cursor->next->next->next->data == 'd' && cursor->next->next->next->next->data == 'y' && cursor->next->next->next->next->next->data == '>' [L545] EXPR, FCALL cursor->next [L545] EXPR, FCALL cursor->next->next [L545] EXPR, FCALL cursor->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next [L545] EXPR, FCALL cursor->next->next->next->next->next [L545] FCALL cursor->next->next->next->next->next->data - 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]: 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]: 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 - 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 - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification 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/split_list_test05_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-27-35-224.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-27-35-224.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-27-35-224.csv Received shutdown request...