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_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:27:07,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:27:07,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:27:07,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:27:07,976 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:27:07,977 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:27:07,978 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:27:07,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:27:07,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:27:07,982 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:27:07,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:27:07,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:27:07,983 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:27:07,984 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:27:07,985 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:27:07,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:27:07,989 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:27:07,991 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:27:07,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:27:07,994 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:27:07,996 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:27:07,996 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:27:07,996 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:27:07,997 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:27:07,998 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:27:07,999 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:27:08,000 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:27:08,000 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:27:08,000 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:27:08,001 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:27:08,001 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:27:08,002 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:08,011 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:27:08,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:27:08,012 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:27:08,012 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:27:08,013 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:27:08,013 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:27:08,013 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:27:08,013 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:27:08,014 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:27:08,014 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:27:08,014 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:27:08,015 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:27:08,015 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:27:08,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:27:08,015 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:27:08,015 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:27:08,015 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:27:08,016 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:27:08,016 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:27:08,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:27:08,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:27:08,017 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:27:08,017 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:27:08,017 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:27:08,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:27:08,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:27:08,018 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:27:08,018 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:27:08,018 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:27:08,018 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:27:08,018 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:27:08,019 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:27:08,019 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:27:08,020 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:27:08,020 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:27:08,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:27:08,069 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:27:08,073 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:27:08,075 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:27:08,075 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:27:08,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-24 16:27:08,250 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:27:08,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:27:08,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:08,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:27:08,262 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:27:08,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:08" (1/1) ... [2018-01-24 16:27:08,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc7c49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:08, skipping insertion in model container [2018-01-24 16:27:08,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:08" (1/1) ... [2018-01-24 16:27:08,278 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:08,318 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:08,433 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:08,452 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:08,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:08 WrapperNode [2018-01-24 16:27:08,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:08,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:27:08,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:27:08,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:27:08,480 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:08" (1/1) ... [2018-01-24 16:27:08,481 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:08" (1/1) ... [2018-01-24 16:27:08,493 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:08" (1/1) ... [2018-01-24 16:27:08,494 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:08" (1/1) ... [2018-01-24 16:27:08,501 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:08" (1/1) ... [2018-01-24 16:27:08,507 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:08" (1/1) ... [2018-01-24 16:27:08,509 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:08" (1/1) ... [2018-01-24 16:27:08,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:27:08,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:27:08,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:27:08,512 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:27:08,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:08" (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:08,566 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:27:08,567 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:27:08,567 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:27:08,567 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:27:08,567 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:27:08,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:27:08,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:27:08,567 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:27:08,568 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:27:08,568 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:27:08,568 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:27:08,568 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:27:08,568 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:27:08,568 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:27:09,091 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:27:09,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:09 BoogieIcfgContainer [2018-01-24 16:27:09,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:27:09,093 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:27:09,093 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:27:09,093 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:27:09,094 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:09" (1/1) ... [2018-01-24 16:27:09,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:27:12,124 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:27:12,161 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:27:12,178 INFO L268 AbstractInterpreter]: Visited 147 different actions 645 times. Merged at 112 different actions 349 times. Widened at 3 different actions 3 times. Found 75 fixpoints after 32 different actions. Largest state had 65 variables. [2018-01-24 16:27:12,181 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:27:12,182 INFO L168 Benchmark]: Toolchain (without parser) took 3931.95 ms. Allocated memory was 304.1 MB in the beginning and 648.0 MB in the end (delta: 343.9 MB). Free memory was 264.0 MB in the beginning and 315.9 MB in the end (delta: -51.9 MB). Peak memory consumption was 292.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:12,183 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:27:12,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.58 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:12,184 INFO L168 Benchmark]: Boogie Preprocessor took 50.16 ms. Allocated memory is still 304.1 MB. Free memory was 252.0 MB in the beginning and 250.0 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:12,184 INFO L168 Benchmark]: RCFGBuilder took 580.27 ms. Allocated memory is still 304.1 MB. Free memory was 250.0 MB in the beginning and 216.0 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:12,185 INFO L168 Benchmark]: Abstract Interpretation took 3088.43 ms. Allocated memory was 304.1 MB in the beginning and 648.0 MB in the end (delta: 343.9 MB). Free memory was 216.0 MB in the beginning and 315.9 MB in the end (delta: -99.8 MB). Peak memory consumption was 244.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:12,186 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.21 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.58 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.16 ms. Allocated memory is still 304.1 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 580.27 ms. Allocated memory is still 304.1 MB. Free memory was 250.0 MB in the beginning and 216.0 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 3088.43 ms. Allocated memory was 304.1 MB in the beginning and 648.0 MB in the end (delta: 343.9 MB). Free memory was 216.0 MB in the beginning and 315.9 MB in the end (delta: -99.8 MB). Peak memory consumption was 244.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 109 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1209 LocStat_NO_SUPPORTING_DISEQUALITIES : 292 LocStat_NO_DISJUNCTIONS : -218 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 151 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 266 TransStat_NO_SUPPORTING_DISEQUALITIES : 68 TransStat_NO_DISJUNCTIONS : 194 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.027117 RENAME_VARIABLES(MILLISECONDS) : 0.435885 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.000929 PROJECTAWAY(MILLISECONDS) : 0.279070 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000882 DISJOIN(MILLISECONDS) : 0.730691 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.471967 ADD_EQUALITY(MILLISECONDS) : 0.013237 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016912 #CONJOIN_DISJUNCTIVE : 995 #RENAME_VARIABLES : 2137 #UNFREEZE : 0 #CONJOIN : 1456 #PROJECTAWAY : 1196 #ADD_WEAK_EQUALITY : 48 #DISJOIN : 194 #RENAME_VARIABLES_DISJUNCTIVE : 1871 #ADD_EQUALITY : 266 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 58 - 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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] COND TRUE n->left || n->right [L653] pred = n [L654] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] EXPR, FCALL n->right [L630] n->left && n->right [L630] COND TRUE n->left && n->right [L631] COND TRUE __VERIFIER_nondet_int() [L632] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] EXPR, FCALL n->right [L630] n->left && n->right [L630] COND TRUE n->left && n->right [L631] COND FALSE !(__VERIFIER_nondet_int()) [L634] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] COND TRUE n->left || n->right [L653] pred = n [L654] FCALL n->left [L654] COND TRUE n->left [L655] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND TRUE !n->left && __VERIFIER_nondet_int() [L637] EXPR, FCALL malloc(sizeof(*n)) [L637] FCALL n->left = malloc(sizeof(*n)) - 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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND TRUE !n->left && __VERIFIER_nondet_int() [L637] EXPR, FCALL malloc(sizeof(*n)) [L637] FCALL n->left = malloc(sizeof(*n)) - 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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] EXPR, FCALL n->right [L630] n->left && n->right [L630] COND TRUE n->left && n->right [L631] COND TRUE __VERIFIER_nondet_int() [L632] EXPR, FCALL n->left [L632] n = n->left [L630] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND TRUE !n->left && __VERIFIER_nondet_int() [L637] EXPR, FCALL malloc(sizeof(*n)) [L637] FCALL n->left = malloc(sizeof(*n)) [L638] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] EXPR, FCALL n->right [L652] n->left || n->right [L652] COND TRUE n->left || n->right [L653] pred = n [L654] FCALL n->left [L654] COND FALSE !(n->left) [L657] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND TRUE !n->left && __VERIFIER_nondet_int() [L637] EXPR, FCALL malloc(sizeof(*n)) [L637] FCALL n->left = malloc(sizeof(*n)) [L638] EXPR, FCALL n->left [L638] FCALL n->left->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] COND TRUE n->left || n->right [L653] pred = n [L654] FCALL n->left [L654] COND TRUE n->left [L655] EXPR, FCALL n->left [L655] n = n->left [L652] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR, FCALL n->right [L641] !n->right && __VERIFIER_nondet_int() [L641] !n->right && __VERIFIER_nondet_int() [L641] COND TRUE !n->right && __VERIFIER_nondet_int() [L642] EXPR, FCALL malloc(sizeof(*n)) [L642] FCALL n->right = malloc(sizeof(*n)) - 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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR, FCALL n->right [L641] !n->right && __VERIFIER_nondet_int() [L641] !n->right && __VERIFIER_nondet_int() [L641] COND TRUE !n->right && __VERIFIER_nondet_int() [L642] EXPR, FCALL malloc(sizeof(*n)) [L642] FCALL n->right = malloc(sizeof(*n)) - 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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND TRUE !n->left && __VERIFIER_nondet_int() [L637] EXPR, FCALL malloc(sizeof(*n)) [L637] FCALL n->left = malloc(sizeof(*n)) [L638] EXPR, FCALL n->left [L638] FCALL n->left->left = ((void *)0) [L639] FCALL n->left - UnprovableResult [Line: 620]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: abstract domain could reach this error location. Possible FailurePath: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] EXPR, FCALL n->right [L652] n->left || n->right [L652] COND FALSE !(n->left || n->right) [L659] COND FALSE !(\read(*pred)) [L665] root = ((void *)0) [L666] FCALL free(n) [L649] COND FALSE !(\read(*root)) [L668] return 0; - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR, FCALL n->right [L641] !n->right && __VERIFIER_nondet_int() [L641] !n->right && __VERIFIER_nondet_int() [L641] COND TRUE !n->right && __VERIFIER_nondet_int() [L642] EXPR, FCALL malloc(sizeof(*n)) [L642] FCALL n->right = malloc(sizeof(*n)) [L643] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND TRUE !n->left && __VERIFIER_nondet_int() [L637] EXPR, FCALL malloc(sizeof(*n)) [L637] FCALL n->left = malloc(sizeof(*n)) [L638] EXPR, FCALL n->left [L638] FCALL n->left->left = ((void *)0) [L639] EXPR, FCALL n->left [L639] FCALL n->left->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND TRUE !n->left && __VERIFIER_nondet_int() [L637] EXPR, FCALL malloc(sizeof(*n)) [L637] FCALL n->left = malloc(sizeof(*n)) [L638] EXPR, FCALL n->left [L638] FCALL n->left->left = ((void *)0) [L639] EXPR, FCALL n->left [L639] FCALL n->left->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR, FCALL n->right [L641] !n->right && __VERIFIER_nondet_int() [L641] !n->right && __VERIFIER_nondet_int() [L641] COND TRUE !n->right && __VERIFIER_nondet_int() [L642] EXPR, FCALL malloc(sizeof(*n)) [L642] FCALL n->right = malloc(sizeof(*n)) [L643] EXPR, FCALL n->right [L643] FCALL n->right->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR, FCALL n->right [L641] !n->right && __VERIFIER_nondet_int() [L641] !n->right && __VERIFIER_nondet_int() [L641] COND TRUE !n->right && __VERIFIER_nondet_int() [L642] EXPR, FCALL malloc(sizeof(*n)) [L642] FCALL n->right = malloc(sizeof(*n)) [L643] EXPR, FCALL n->right [L643] FCALL n->right->left = ((void *)0) [L644] FCALL n->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR, FCALL n->right [L641] !n->right && __VERIFIER_nondet_int() [L641] !n->right && __VERIFIER_nondet_int() [L641] COND TRUE !n->right && __VERIFIER_nondet_int() [L642] EXPR, FCALL malloc(sizeof(*n)) [L642] FCALL n->right = malloc(sizeof(*n)) [L643] EXPR, FCALL n->right [L643] FCALL n->right->left = ((void *)0) [L644] EXPR, FCALL n->right [L644] FCALL n->right->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR, FCALL n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR, FCALL n->left [L636] !n->left && __VERIFIER_nondet_int() [L636] !n->left && __VERIFIER_nondet_int() [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR, FCALL n->right [L641] !n->right && __VERIFIER_nondet_int() [L641] !n->right && __VERIFIER_nondet_int() [L641] COND TRUE !n->right && __VERIFIER_nondet_int() [L642] EXPR, FCALL malloc(sizeof(*n)) [L642] FCALL n->right = malloc(sizeof(*n)) [L643] EXPR, FCALL n->right [L643] FCALL n->right->left = ((void *)0) [L644] EXPR, FCALL n->right [L644] FCALL n->right->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] COND TRUE n->left || n->right [L653] pred = n [L654] FCALL n->left [L654] COND TRUE n->left [L655] EXPR, FCALL n->left [L655] n = n->left [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] EXPR, FCALL n->right [L652] n->left || n->right [L652] COND FALSE !(n->left || n->right) [L659] COND TRUE \read(*pred) [L660] 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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] COND TRUE n->left || n->right [L653] pred = n [L654] FCALL n->left [L654] COND TRUE n->left [L655] EXPR, FCALL n->left [L655] n = n->left [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] EXPR, FCALL n->right [L652] n->left || n->right [L652] COND FALSE !(n->left || n->right) [L659] COND TRUE \read(*pred) [L660] FCALL pred->left - 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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] COND TRUE n->left || n->right [L653] pred = n [L654] FCALL n->left [L654] COND TRUE n->left [L655] EXPR, FCALL n->left [L655] n = n->left [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] EXPR, FCALL n->right [L652] n->left || n->right [L652] COND FALSE !(n->left || n->right) [L659] COND FALSE !(\read(*pred)) [L665] root = ((void *)0) [L666] FCALL free(n) - 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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] COND TRUE n->left || n->right [L653] pred = n [L654] FCALL n->left [L654] COND TRUE n->left [L655] EXPR, FCALL n->left [L655] n = n->left [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] EXPR, FCALL n->right [L652] n->left || n->right [L652] COND FALSE !(n->left || n->right) [L659] COND TRUE \read(*pred) [L660] EXPR, FCALL pred->left [L660] COND TRUE n == pred->left [L661] FCALL pred->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: [L625] EXPR, FCALL malloc(sizeof(*root)) [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] FCALL root->left = ((void *)0) [L627] FCALL root->right = ((void *)0) [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] COND TRUE n->left || n->right [L653] pred = n [L654] FCALL n->left [L654] COND TRUE n->left [L655] EXPR, FCALL n->left [L655] n = n->left [L652] EXPR, FCALL n->left [L652] n->left || n->right [L652] EXPR, FCALL n->right [L652] n->left || n->right [L652] COND FALSE !(n->left || n->right) [L659] COND TRUE \read(*pred) [L660] EXPR, FCALL pred->left [L660] COND FALSE !(n == pred->left) [L663] FCALL pred->right = ((void *)0) - 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 * 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_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-27-12-200.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-27-12-200.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-27-12-200.csv Received shutdown request...