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-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:27:14,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:27:14,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:27:14,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:27:14,029 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:27:14,030 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:27:14,031 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:27:14,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:27:14,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:27:14,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:27:14,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:27:14,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:27:14,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:27:14,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:27:14,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:27:14,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:27:14,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:27:14,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:27:14,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:27:14,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:27:14,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:27:14,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:27:14,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:27:14,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:27:14,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:27:14,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:27:14,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:27:14,057 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:27:14,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:27:14,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:27:14,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:27:14,058 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:14,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:27:14,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:27:14,068 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:27:14,068 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:27:14,068 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:27:14,068 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:27:14,068 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:27:14,068 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:27:14,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:27:14,069 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:27:14,069 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:27:14,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:27:14,069 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:27:14,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:27:14,070 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:27:14,070 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:27:14,070 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:27:14,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:27:14,070 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:27:14,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:27:14,070 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:27:14,070 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:27:14,071 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:27:14,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:27:14,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:27:14,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:27:14,071 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:27:14,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:27:14,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:27:14,072 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:27:14,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:27:14,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:27:14,072 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:27:14,073 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:27:14,073 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:27:14,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:27:14,117 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:27:14,120 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:27:14,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:27:14,121 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:27:14,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-01-24 16:27:14,317 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:27:14,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:27:14,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:14,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:27:14,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:27:14,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:14" (1/1) ... [2018-01-24 16:27:14,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8bf943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:14, skipping insertion in model container [2018-01-24 16:27:14,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:14" (1/1) ... [2018-01-24 16:27:14,357 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:14,401 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:14,531 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:14,559 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:14,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:14 WrapperNode [2018-01-24 16:27:14,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:14,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:27:14,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:27:14,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:27:14,586 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:14" (1/1) ... [2018-01-24 16:27:14,587 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:14" (1/1) ... [2018-01-24 16:27:14,598 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:14" (1/1) ... [2018-01-24 16:27:14,598 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:14" (1/1) ... [2018-01-24 16:27:14,608 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:14" (1/1) ... [2018-01-24 16:27:14,612 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:14" (1/1) ... [2018-01-24 16:27:14,613 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:14" (1/1) ... [2018-01-24 16:27:14,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:27:14,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:27:14,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:27:14,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:27:14,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:14" (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:14,659 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:27:14,659 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:27:14,659 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:27:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:27:14,659 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:27:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:27:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:27:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:27:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:27:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:27:14,660 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:27:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:27:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:27:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:27:15,345 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:27:15,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:15 BoogieIcfgContainer [2018-01-24 16:27:15,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:27:15,347 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:27:15,347 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:27:15,347 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:27:15,348 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:15" (1/1) ... [2018-01-24 16:27:15,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:27:21,504 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:27:21,571 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:27:21,585 INFO L268 AbstractInterpreter]: Visited 243 different actions 1308 times. Merged at 180 different actions 770 times. Widened at 5 different actions 7 times. Found 115 fixpoints after 48 different actions. Largest state had 107 variables. [2018-01-24 16:27:21,588 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:27:21,590 INFO L168 Benchmark]: Toolchain (without parser) took 7272.16 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 712.0 MB). Free memory was 263.1 MB in the beginning and 243.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 731.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:21,591 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:27:21,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.03 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 250.1 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:21,591 INFO L168 Benchmark]: Boogie Preprocessor took 43.63 ms. Allocated memory is still 303.0 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:21,592 INFO L168 Benchmark]: RCFGBuilder took 730.03 ms. Allocated memory is still 303.0 MB. Free memory was 248.1 MB in the beginning and 197.1 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:21,592 INFO L168 Benchmark]: Abstract Interpretation took 6241.82 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 712.0 MB). Free memory was 197.1 MB in the beginning and 243.3 MB in the end (delta: -46.2 MB). Peak memory consumption was 665.8 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:21,593 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 247.03 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 250.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.63 ms. Allocated memory is still 303.0 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 730.03 ms. Allocated memory is still 303.0 MB. Free memory was 248.1 MB in the beginning and 197.1 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 6241.82 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 712.0 MB). Free memory was 197.1 MB in the beginning and 243.3 MB in the end (delta: -46.2 MB). Peak memory consumption was 665.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 186 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 2262 LocStat_NO_SUPPORTING_DISEQUALITIES : 1151 LocStat_NO_DISJUNCTIONS : -372 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 247 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 427 TransStat_NO_SUPPORTING_DISEQUALITIES : 119 TransStat_NO_DISJUNCTIONS : 315 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.034342 RENAME_VARIABLES(MILLISECONDS) : 0.539348 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001342 PROJECTAWAY(MILLISECONDS) : 0.333817 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001573 DISJOIN(MILLISECONDS) : 0.701160 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.575175 ADD_EQUALITY(MILLISECONDS) : 0.011767 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.024192 #CONJOIN_DISJUNCTIVE : 2055 #RENAME_VARIABLES : 4453 #UNFREEZE : 0 #CONJOIN : 2918 #PROJECTAWAY : 2420 #ADD_WEAK_EQUALITY : 86 #DISJOIN : 467 #RENAME_VARIABLES_DISJUNCTIVE : 3916 #ADD_EQUALITY : 425 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 95 - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] FCALL tree->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] FCALL tree->list [L638] FCALL tree->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND TRUE __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(ListNode)) [L641] tmpList = malloc(sizeof(ListNode)) [L642] FCALL tree->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND TRUE __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(ListNode)) [L641] tmpList = malloc(sizeof(ListNode)) [L642] FCALL tree->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND TRUE __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(ListNode)) [L641] tmpList = malloc(sizeof(ListNode)) [L642] EXPR, FCALL tree->list [L642] FCALL tree->list->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND TRUE __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(ListNode)) [L641] tmpList = malloc(sizeof(ListNode)) [L642] EXPR, FCALL tree->list [L642] FCALL tree->list->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] FCALL tmp->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND TRUE __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(ListNode)) [L641] tmpList = malloc(sizeof(ListNode)) [L642] EXPR, FCALL tree->list [L642] EXPR, FCALL tree->list->next [L642] FCALL tmpList->next = tree->list->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] FCALL tmp->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND TRUE __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(ListNode)) [L641] tmpList = malloc(sizeof(ListNode)) [L642] EXPR, FCALL tree->list [L642] EXPR, FCALL tree->list->next [L642] FCALL tmpList->next = tree->list->next [L643] FCALL tree->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] FCALL tmp->right - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND TRUE __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(ListNode)) [L641] tmpList = malloc(sizeof(ListNode)) [L642] EXPR, FCALL tree->list [L642] EXPR, FCALL tree->list->next [L642] FCALL tmpList->next = tree->list->next [L643] EXPR, FCALL tree->list [L643] FCALL tree->list->next = tmpList - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND TRUE __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(ListNode)) [L641] tmpList = malloc(sizeof(ListNode)) [L642] EXPR, FCALL tree->list [L642] EXPR, FCALL tree->list->next [L642] FCALL tmpList->next = tree->list->next [L643] EXPR, FCALL tree->list [L643] FCALL tree->list->next = tmpList - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] FCALL tmp->right - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] FCALL tmp->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND TRUE (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L691] pred = tmp [L692] FCALL tmp->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] EXPR, FCALL tmp->right [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND TRUE (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L650] COND TRUE __VERIFIER_nondet_int() [L652] FCALL tmp->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] EXPR, FCALL tmp->right [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND TRUE (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L650] COND FALSE !(__VERIFIER_nondet_int()) [L656] FCALL tmp->right - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND TRUE (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L691] pred = tmp [L692] EXPR, FCALL tmp->left [L692] COND TRUE ((void *)0) != tmp->left [L694] FCALL tmp->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND FALSE !((((void *)0) == tmp->left) && __VERIFIER_nondet_int()) [L665] FCALL tmp->right - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND TRUE (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L691] pred = tmp [L692] EXPR, FCALL tmp->left [L692] COND FALSE !(((void *)0) != tmp->left) [L698] FCALL tmp->right - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] FCALL tmp->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] EXPR, FCALL tmp->right [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND TRUE (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L650] COND TRUE __VERIFIER_nondet_int() [L652] EXPR, FCALL tmp->left [L652] tmp = tmp->left [L648] FCALL tmp->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND TRUE (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L691] pred = tmp [L692] EXPR, FCALL tmp->left [L692] COND TRUE ((void *)0) != tmp->left [L694] EXPR, FCALL tmp->left [L694] tmp = tmp->left [L689] FCALL tmp->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] FCALL tmp->list [L716] FCALL tmp->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] FCALL tmp->list->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] FCALL tmp->list->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND FALSE !(tmp->list != tmp->list->next) [L722] FCALL tmp->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND TRUE tmp->list != tmp->list->next [L718] FCALL tmp->list - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND FALSE !(tmp->list != tmp->list->next) [L722] EXPR, FCALL tmp->list [L722] FCALL free(tmp->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND TRUE tmp->list != tmp->list->next [L718] EXPR, FCALL tmp->list [L718] FCALL tmp->list->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND FALSE !((((void *)0) == tmp->left) && __VERIFIER_nondet_int()) [L665] EXPR, FCALL tmp->right [L665] (((void *)0) == tmp->right) && __VERIFIER_nondet_int() [L665] (((void *)0) == tmp->right) && __VERIFIER_nondet_int() [L665] COND TRUE (((void *)0) == tmp->right) && __VERIFIER_nondet_int() [L667] EXPR, FCALL malloc(sizeof(*newNode)) [L667] newNode = malloc(sizeof(*newNode)) [L668] FCALL tmp->right = newNode - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND FALSE !((((void *)0) == tmp->left) && __VERIFIER_nondet_int()) [L665] EXPR, FCALL tmp->right [L665] (((void *)0) == tmp->right) && __VERIFIER_nondet_int() [L665] (((void *)0) == tmp->right) && __VERIFIER_nondet_int() [L665] COND TRUE (((void *)0) == tmp->right) && __VERIFIER_nondet_int() [L667] EXPR, FCALL malloc(sizeof(*newNode)) [L667] newNode = malloc(sizeof(*newNode)) [L668] FCALL tmp->right = newNode - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] FCALL newNode->list - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND FALSE !(tmp->list != tmp->list->next) [L722] EXPR, FCALL tmp->list [L722] FCALL free(tmp->list) [L723] FCALL free(tmp) - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND TRUE tmp->list != tmp->list->next [L718] EXPR, FCALL tmp->list [L718] EXPR, FCALL tmp->list->next [L718] tmpList = tmp->list->next [L719] FCALL tmp->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] FCALL newNode->list [L677] FCALL newNode->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND TRUE (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L691] pred = tmp [L692] EXPR, FCALL tmp->left [L692] COND TRUE ((void *)0) != tmp->left [L694] EXPR, FCALL tmp->left [L694] tmp = tmp->left [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND TRUE ((void *)0) != pred [L703] FCALL pred->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND TRUE (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L691] pred = tmp [L692] EXPR, FCALL tmp->left [L692] COND TRUE ((void *)0) != tmp->left [L694] EXPR, FCALL tmp->left [L694] tmp = tmp->left [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND TRUE ((void *)0) != pred [L703] FCALL pred->left - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND TRUE tmp->list != tmp->list->next [L718] EXPR, FCALL tmp->list [L718] EXPR, FCALL tmp->list->next [L718] tmpList = tmp->list->next [L719] FCALL tmp->list [L719] FCALL tmpList->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND TRUE tmp->list != tmp->list->next [L718] EXPR, FCALL tmp->list [L718] EXPR, FCALL tmp->list->next [L718] tmpList = tmp->list->next [L719] FCALL tmp->list [L719] FCALL tmpList->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] EXPR, FCALL newNode->list [L677] EXPR, FCALL newNode->list [L677] FCALL newNode->list->next = newNode->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND TRUE tmp->list != tmp->list->next [L718] EXPR, FCALL tmp->list [L718] EXPR, FCALL tmp->list->next [L718] tmpList = tmp->list->next [L719] EXPR, FCALL tmp->list [L719] EXPR, FCALL tmpList->next [L719] FCALL tmp->list->next = tmpList->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND TRUE (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L691] pred = tmp [L692] EXPR, FCALL tmp->left [L692] COND TRUE ((void *)0) != tmp->left [L694] EXPR, FCALL tmp->left [L694] tmp = tmp->left [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND TRUE ((void *)0) != pred [L703] EXPR, FCALL pred->left [L703] COND FALSE !(tmp == pred->left) [L709] FCALL pred->right = ((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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND TRUE (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L691] pred = tmp [L692] EXPR, FCALL tmp->left [L692] COND TRUE ((void *)0) != tmp->left [L694] EXPR, FCALL tmp->left [L694] tmp = tmp->left [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND TRUE ((void *)0) != pred [L703] EXPR, FCALL pred->left [L703] COND TRUE tmp == pred->left [L705] FCALL pred->left = ((void *)0) - UnprovableResult [Line: 630]: 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND FALSE !(tmp->list != tmp->list->next) [L722] EXPR, FCALL tmp->list [L722] FCALL free(tmp->list) [L723] FCALL free(tmp) [L685] COND FALSE !(((void *)0) != tree) [L725] 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND TRUE tmp->list != tmp->list->next [L718] EXPR, FCALL tmp->list [L718] EXPR, FCALL tmp->list->next [L718] tmpList = tmp->list->next [L719] EXPR, FCALL tmp->list [L719] EXPR, FCALL tmpList->next [L719] FCALL tmp->list->next = tmpList->next [L720] FCALL free(tmpList) - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND TRUE tmp->list != tmp->list->next [L718] EXPR, FCALL tmp->list [L718] EXPR, FCALL tmp->list->next [L718] tmpList = tmp->list->next [L719] EXPR, FCALL tmp->list [L719] EXPR, FCALL tmpList->next [L719] FCALL tmp->list->next = tmpList->next [L720] FCALL free(tmpList) [L716] FCALL tmp->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] EXPR, FCALL newNode->list [L677] EXPR, FCALL newNode->list [L677] FCALL newNode->list->next = newNode->list [L678] COND TRUE __VERIFIER_nondet_int() [L680] EXPR, FCALL malloc(sizeof(ListNode)) [L680] tmpList = malloc(sizeof(ListNode)) [L681] FCALL tree->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] EXPR, FCALL newNode->list [L677] EXPR, FCALL newNode->list [L677] FCALL newNode->list->next = newNode->list [L678] COND TRUE __VERIFIER_nondet_int() [L680] EXPR, FCALL malloc(sizeof(ListNode)) [L680] tmpList = malloc(sizeof(ListNode)) [L681] FCALL tree->list - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND TRUE (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L691] pred = tmp [L692] EXPR, FCALL tmp->left [L692] COND TRUE ((void *)0) != tmp->left [L694] EXPR, FCALL tmp->left [L694] tmp = tmp->left [L689] EXPR, FCALL tmp->left [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] EXPR, FCALL tmp->right [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list [L716] EXPR, FCALL tmp->list->next [L716] COND FALSE !(tmp->list != tmp->list->next) [L722] EXPR, FCALL tmp->list [L722] FCALL free(tmp->list) [L723] FCALL free(tmp) - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] EXPR, FCALL newNode->list [L677] EXPR, FCALL newNode->list [L677] FCALL newNode->list->next = newNode->list [L678] COND TRUE __VERIFIER_nondet_int() [L680] EXPR, FCALL malloc(sizeof(ListNode)) [L680] tmpList = malloc(sizeof(ListNode)) [L681] EXPR, FCALL tree->list [L681] FCALL tree->list->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] EXPR, FCALL newNode->list [L677] EXPR, FCALL newNode->list [L677] FCALL newNode->list->next = newNode->list [L678] COND TRUE __VERIFIER_nondet_int() [L680] EXPR, FCALL malloc(sizeof(ListNode)) [L680] tmpList = malloc(sizeof(ListNode)) [L681] EXPR, FCALL tree->list [L681] FCALL tree->list->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] EXPR, FCALL newNode->list [L677] EXPR, FCALL newNode->list [L677] FCALL newNode->list->next = newNode->list [L678] COND TRUE __VERIFIER_nondet_int() [L680] EXPR, FCALL malloc(sizeof(ListNode)) [L680] tmpList = malloc(sizeof(ListNode)) [L681] EXPR, FCALL tree->list [L681] EXPR, FCALL tree->list->next [L681] FCALL tmpList->next = tree->list->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] EXPR, FCALL newNode->list [L677] EXPR, FCALL newNode->list [L677] FCALL newNode->list->next = newNode->list [L678] COND TRUE __VERIFIER_nondet_int() [L680] EXPR, FCALL malloc(sizeof(ListNode)) [L680] tmpList = malloc(sizeof(ListNode)) [L681] EXPR, FCALL tree->list [L681] EXPR, FCALL tree->list->next [L681] FCALL tmpList->next = tree->list->next [L682] FCALL tree->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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] EXPR, FCALL newNode->list [L677] EXPR, FCALL newNode->list [L677] FCALL newNode->list->next = newNode->list [L678] COND TRUE __VERIFIER_nondet_int() [L680] EXPR, FCALL malloc(sizeof(ListNode)) [L680] tmpList = malloc(sizeof(ListNode)) [L681] EXPR, FCALL tree->list [L681] EXPR, FCALL tree->list->next [L681] FCALL tmpList->next = tree->list->next [L682] EXPR, FCALL tree->list [L682] FCALL tree->list->next = tmpList - 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; [L635] FCALL tree->left = ((void *)0) [L636] FCALL tree->right = ((void *)0) [L637] EXPR, FCALL malloc(sizeof(ListNode)) [L637] FCALL tree->list = malloc(sizeof(ListNode)) [L638] EXPR, FCALL tree->list [L638] EXPR, FCALL tree->list [L638] FCALL tree->list->next = tree->list [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND TRUE __VERIFIER_nondet_int() [L647] tmp = tree [L648] EXPR, FCALL tmp->left [L648] (((void *)0) != tmp->left) && (((void *)0) != tmp->right) [L648] COND FALSE !((((void *)0) != tmp->left) && (((void *)0) != tmp->right)) [L659] TreeNode* newNode; [L660] EXPR, FCALL tmp->left [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L660] COND TRUE (((void *)0) == tmp->left) && __VERIFIER_nondet_int() [L662] EXPR, FCALL malloc(sizeof(*newNode)) [L662] newNode = malloc(sizeof(*newNode)) [L663] FCALL tmp->left = newNode [L674] FCALL newNode->left = ((void *)0) [L675] FCALL newNode->right = ((void *)0) [L676] EXPR, FCALL malloc(sizeof(*newNode->list)) [L676] FCALL newNode->list = malloc(sizeof(*newNode->list)) [L677] EXPR, FCALL newNode->list [L677] EXPR, FCALL newNode->list [L677] FCALL newNode->list->next = newNode->list [L678] COND TRUE __VERIFIER_nondet_int() [L680] EXPR, FCALL malloc(sizeof(ListNode)) [L680] tmpList = malloc(sizeof(ListNode)) [L681] EXPR, FCALL tree->list [L681] EXPR, FCALL tree->list->next [L681] FCALL tmpList->next = tree->list->next [L682] EXPR, FCALL tree->list [L682] FCALL tree->list->next = tmpList - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: 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]: 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/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-27-21-609.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-27-21-609.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-27-21-609.csv Received shutdown request...