./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b50a14aaadb91f0d2171e26e1cac3b7310be0682 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:15:36,997 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:15:36,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:15:37,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:15:37,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:15:37,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:15:37,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:15:37,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:15:37,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:15:37,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:15:37,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:15:37,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:15:37,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:15:37,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:15:37,016 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:15:37,016 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:15:37,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:15:37,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:15:37,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:15:37,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:15:37,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:15:37,024 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:15:37,026 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:15:37,026 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:15:37,026 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:15:37,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:15:37,028 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:15:37,029 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:15:37,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:15:37,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:15:37,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:15:37,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:15:37,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:15:37,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:15:37,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:15:37,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:15:37,033 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 13:15:37,045 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:15:37,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:15:37,046 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:15:37,046 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 13:15:37,047 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:15:37,047 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:15:37,047 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:15:37,048 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:15:37,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:15:37,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:15:37,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:15:37,048 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:15:37,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:15:37,049 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:15:37,049 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:15:37,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:15:37,049 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:15:37,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:15:37,050 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 13:15:37,050 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 13:15:37,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:15:37,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:15:37,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 13:15:37,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:15:37,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:15:37,051 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:15:37,051 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 13:15:37,051 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:15:37,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:15:37,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b50a14aaadb91f0d2171e26e1cac3b7310be0682 [2018-11-23 13:15:37,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:15:37,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:15:37,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:15:37,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:15:37,091 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:15:37,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-23 13:15:37,136 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/data/ce1c48696/8467ef0e4eb649a2bb18d2847e62cd38/FLAGe7a1fe800 [2018-11-23 13:15:37,544 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:15:37,544 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-23 13:15:37,553 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/data/ce1c48696/8467ef0e4eb649a2bb18d2847e62cd38/FLAGe7a1fe800 [2018-11-23 13:15:37,920 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/data/ce1c48696/8467ef0e4eb649a2bb18d2847e62cd38 [2018-11-23 13:15:37,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:15:37,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:15:37,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:15:37,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:15:37,927 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:15:37,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:37" (1/1) ... [2018-11-23 13:15:37,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33dd1227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:37, skipping insertion in model container [2018-11-23 13:15:37,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:37" (1/1) ... [2018-11-23 13:15:37,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:15:37,969 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:15:38,177 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:15:38,186 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:15:38,273 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:15:38,299 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:15:38,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38 WrapperNode [2018-11-23 13:15:38,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:15:38,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:15:38,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:15:38,300 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:15:38,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:15:38,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:15:38,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:15:38,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:15:38,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:15:38,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:15:38,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:15:38,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:15:38,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 13:15:38,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:15:38,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:15:38,402 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-23 13:15:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-23 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:15:38,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:15:38,919 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:15:38,920 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2018-11-23 13:15:38,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:38 BoogieIcfgContainer [2018-11-23 13:15:38,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:15:38,921 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 13:15:38,921 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 13:15:38,928 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 13:15:38,928 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:38" (1/1) ... [2018-11-23 13:15:38,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2018-11-23 13:15:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2018-11-23 13:15:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:15:38,964 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 26 states and 39 transitions. [2018-11-23 13:15:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. [2018-11-23 13:15:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:15:39,044 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 31 states and 47 transitions. [2018-11-23 13:15:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2018-11-23 13:15:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:15:39,200 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 32 states and 50 transitions. [2018-11-23 13:15:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2018-11-23 13:15:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:15:39,409 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 31 states and 48 transitions. [2018-11-23 13:15:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2018-11-23 13:15:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:15:39,561 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 31 states and 45 transitions. [2018-11-23 13:15:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2018-11-23 13:15:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:15:39,722 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 40 states and 69 transitions. [2018-11-23 13:15:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 69 transitions. [2018-11-23 13:15:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:15:41,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 46 states and 87 transitions. [2018-11-23 13:15:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 87 transitions. [2018-11-23 13:15:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:15:42,219 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 47 states and 87 transitions. [2018-11-23 13:15:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2018-11-23 13:15:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:15:42,491 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-11-23 13:15:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-11-23 13:15:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:15:42,860 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 52 states and 106 transitions. [2018-11-23 13:15:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2018-11-23 13:15:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:15:44,427 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 53 states and 112 transitions. [2018-11-23 13:15:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 112 transitions. [2018-11-23 13:15:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:15:45,135 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:15:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 56 states and 135 transitions. [2018-11-23 13:15:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 135 transitions. [2018-11-23 13:15:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:15:47,237 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:15:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,955 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 13 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~ret23.base, main_#t~ret23.offset, main_~data~0.base, main_~data~0.offset;havoc create_tree_#res.base, create_tree_#res.offset;havoc create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, create_tree_#t~mem12.base, create_tree_#t~mem12.offset, create_tree_#t~mem13.base, create_tree_#t~mem13.offset, create_tree_#t~mem14.base, create_tree_#t~mem14.offset, create_tree_#t~mem15.base, create_tree_#t~mem15.offset, create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, create_tree_~node~0.offset;create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := 0, 0;create_tree_~node~0.base, create_tree_~node~0.offset := 0, 0; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=0, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=0, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~nondet7|=(- 1)] [?] assume !!(0 != create_tree_#t~nondet7);havoc create_tree_#t~nondet7;call create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset := #Ultimate.alloc(16);create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset;BeginParallelComposition{ParallelCodeBlock0: assume create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0;assume false;ParallelCodeBlock1: assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0);}EndParallelCompositioncall write~$Pointer$(0, 0, create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~$Pointer$(create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4);BeginParallelComposition{ParallelCodeBlock0: assume create_tree_~nodelast~0.base != 0 || create_tree_~nodelast~0.offset != 0;call write~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, create_tree_~nodelast~0.base, 8 + create_tree_~nodelast~0.offset, 4);ParallelCodeBlock1: assume !(create_tree_~nodelast~0.base != 0 || create_tree_~nodelast~0.offset != 0);}EndParallelCompositionassume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647;create_tree_~value~0 := create_tree_#t~nondet9;havoc create_tree_#t~nondet9;call write~int(create_tree_~value~0, create_tree_~node~0.base, 12 + create_tree_~node~0.offset, 4);create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := create_tree_~node~0.base, create_tree_~node~0.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=3, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0] [?] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=3, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_create_tree_#t~nondet7|=0] [?] assume !(0 != create_tree_#t~nondet7);havoc create_tree_#t~nondet7; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=3, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0] [?] assume !!(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0);call create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset := #Ultimate.alloc(16);call write~$Pointer$(create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_~node~0.base, create_tree_~node~0.offset, 4);BeginParallelComposition{ParallelCodeBlock0: assume create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0;assume false;ParallelCodeBlock1: assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0);}EndParallelCompositioncall create_tree_#t~mem11.base, create_tree_#t~mem11.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~$Pointer$(0, 0, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, 4);havoc create_tree_#t~mem11.base, create_tree_#t~mem11.offset;call create_tree_#t~mem12.base, create_tree_#t~mem12.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~$Pointer$(0, 0, create_tree_#t~mem12.base, 4 + create_tree_#t~mem12.offset, 4);havoc create_tree_#t~mem12.base, create_tree_#t~mem12.offset;call create_tree_#t~mem13.base, create_tree_#t~mem13.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~int(42, create_tree_#t~mem13.base, 12 + create_tree_#t~mem13.offset, 4);havoc create_tree_#t~mem13.base, create_tree_#t~mem13.offset;call create_tree_#t~mem14.base, create_tree_#t~mem14.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, create_tree_#t~mem14.base, 8 + create_tree_#t~mem14.offset, 4);havoc create_tree_#t~mem14.base, create_tree_#t~mem14.offset;call create_tree_#t~mem15.base, create_tree_#t~mem15.offset := read~$Pointer$(create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4);create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~mem15.base, create_tree_#t~mem15.offset;havoc create_tree_#t~mem15.base, create_tree_#t~mem15.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0);}EndParallelCompositioncreate_tree_#res.base, create_tree_#res.offset := create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset;main_#t~ret23.base, main_#t~ret23.offset := create_tree_#res.base, create_tree_#res.offset;main_~data~0.base, main_~data~0.offset := main_#t~ret23.base, main_#t~ret23.offset;havoc main_#t~ret23.base, main_#t~ret23.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0] [?] assume !(main_~data~0.base == 0 && main_~data~0.offset == 0);inspect_#in~node.base, inspect_#in~node.offset := main_~data~0.base, main_~data~0.offset;havoc inspect_#t~mem2.base, inspect_#t~mem2.offset, inspect_#t~mem3.base, inspect_#t~mem3.offset, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6.base, inspect_#t~mem6.offset, inspect_~node.base, inspect_~node.offset;inspect_~node.base, inspect_~node.offset := inspect_#in~node.base, inspect_#in~node.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] assume !(inspect_~node.base == 0 && inspect_~node.offset == 0); VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] goto; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] assume !!(inspect_~node.base != 0 || inspect_~node.offset != 0);call inspect_#t~mem2.base, inspect_#t~mem2.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0, |ULTIMATE.start_inspect_#t~mem2.base|=10, |ULTIMATE.start_inspect_#t~mem2.offset|=0] [?] assume inspect_#t~mem2.base != 0 || inspect_#t~mem2.offset != 0;havoc inspect_#t~mem2.base, inspect_#t~mem2.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] call inspect_#t~mem3.base, inspect_#t~mem3.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4);call inspect_#t~mem4 := read~int(inspect_#t~mem3.base, 12 + inspect_#t~mem3.offset, 4); VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0, |ULTIMATE.start_inspect_#t~mem3.base|=10, |ULTIMATE.start_inspect_#t~mem3.offset|=0, |ULTIMATE.start_inspect_#t~mem4|=42] [?] assume !!(42 == inspect_#t~mem4);havoc inspect_#t~mem3.base, inspect_#t~mem3.offset;havoc inspect_#t~mem4; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] goto; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] call inspect_#t~mem5 := read~int(inspect_~node.base, 12 + inspect_~node.offset, 4); VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0, |ULTIMATE.start_inspect_#t~mem5|=0] [?] assume 0 == inspect_#t~mem5;havoc inspect_#t~mem5; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] CALL call fail(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret23.base, main_#t~ret23.offset, main_~data~0.base, main_~data~0.offset; [L619] havoc create_tree_#res.base, create_tree_#res.offset; [L619] havoc create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, create_tree_#t~mem12.base, create_tree_#t~mem12.offset, create_tree_#t~mem13.base, create_tree_#t~mem13.offset, create_tree_#t~mem14.base, create_tree_#t~mem14.offset, create_tree_#t~mem15.base, create_tree_#t~mem15.offset, create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, create_tree_~node~0.offset; [L574] create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := 0, 0; [L575] create_tree_~node~0.base, create_tree_~node~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~nondet7=-1, create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0] [L576-L587] assume !!(0 != create_tree_#t~nondet7); [L576] havoc create_tree_#t~nondet7; [L577] call create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset := #Ultimate.alloc(16); [L577] create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset; [L578-L579] assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0); [L580] call write~$Pointer$(0, 0, create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L581] call write~$Pointer$(create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4); [L582-L583] assume !(create_tree_~nodelast~0.base != 0 || create_tree_~nodelast~0.offset != 0); [L584] assume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647; [L584] create_tree_~value~0 := create_tree_#t~nondet9; [L584] havoc create_tree_#t~nondet9; [L585] call write~int(create_tree_~value~0, create_tree_~node~0.base, 12 + create_tree_~node~0.offset, 4); [L586] create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := create_tree_~node~0.base, create_tree_~node~0.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_#t~nondet7=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L576-L587] assume !(0 != create_tree_#t~nondet7); [L576] havoc create_tree_#t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L588-L597] assume !!(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0); [L589] call create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset := #Ultimate.alloc(16); [L589] call write~$Pointer$(create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L590-L591] assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0); [L592] call create_tree_#t~mem11.base, create_tree_#t~mem11.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L592] call write~$Pointer$(0, 0, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, 4); [L592] havoc create_tree_#t~mem11.base, create_tree_#t~mem11.offset; [L593] call create_tree_#t~mem12.base, create_tree_#t~mem12.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L593] call write~$Pointer$(0, 0, create_tree_#t~mem12.base, 4 + create_tree_#t~mem12.offset, 4); [L593] havoc create_tree_#t~mem12.base, create_tree_#t~mem12.offset; [L594] call create_tree_#t~mem13.base, create_tree_#t~mem13.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L594] call write~int(42, create_tree_#t~mem13.base, 12 + create_tree_#t~mem13.offset, 4); [L594] havoc create_tree_#t~mem13.base, create_tree_#t~mem13.offset; [L595] call create_tree_#t~mem14.base, create_tree_#t~mem14.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L595] call write~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, create_tree_#t~mem14.base, 8 + create_tree_#t~mem14.offset, 4); [L595] havoc create_tree_#t~mem14.base, create_tree_#t~mem14.offset; [L596] call create_tree_#t~mem15.base, create_tree_#t~mem15.offset := read~$Pointer$(create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4); [L596] create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~mem15.base, create_tree_#t~mem15.offset; [L596] havoc create_tree_#t~mem15.base, create_tree_#t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L588-L597] assume !(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0); [L598] create_tree_#res.base, create_tree_#res.offset := create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset; [L619] main_#t~ret23.base, main_#t~ret23.offset := create_tree_#res.base, create_tree_#res.offset; [L619] main_~data~0.base, main_~data~0.offset := main_#t~ret23.base, main_#t~ret23.offset; [L619] havoc main_#t~ret23.base, main_#t~ret23.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, main_~data~0.base=3, main_~data~0.offset=0] [L620-L621] assume !(main_~data~0.base == 0 && main_~data~0.offset == 0); [L622] inspect_#in~node.base, inspect_#in~node.offset := main_~data~0.base, main_~data~0.offset; [L622] havoc inspect_#t~mem2.base, inspect_#t~mem2.offset, inspect_#t~mem3.base, inspect_#t~mem3.offset, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6.base, inspect_#t~mem6.offset, inspect_~node.base, inspect_~node.offset; [L562-L571] inspect_~node.base, inspect_~node.offset := inspect_#in~node.base, inspect_#in~node.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L564] assume !(inspect_~node.base == 0 && inspect_~node.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L565-L570] assume !!(inspect_~node.base != 0 || inspect_~node.offset != 0); [L566] call inspect_#t~mem2.base, inspect_#t~mem2.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem2.base=10, inspect_#t~mem2.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L566-L567] assume inspect_#t~mem2.base != 0 || inspect_#t~mem2.offset != 0; [L566] havoc inspect_#t~mem2.base, inspect_#t~mem2.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L567] call inspect_#t~mem3.base, inspect_#t~mem3.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); [L567] call inspect_#t~mem4 := read~int(inspect_#t~mem3.base, 12 + inspect_#t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem3.base=10, inspect_#t~mem3.offset=0, inspect_#t~mem4=42, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L567] assume !!(42 == inspect_#t~mem4); [L567] havoc inspect_#t~mem3.base, inspect_#t~mem3.offset; [L567] havoc inspect_#t~mem4; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] call inspect_#t~mem5 := read~int(inspect_~node.base, 12 + inspect_~node.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem5=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] assume 0 == inspect_#t~mem5; [L568] havoc inspect_#t~mem5; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret23.base, main_#t~ret23.offset, main_~data~0.base, main_~data~0.offset; [L619] havoc create_tree_#res.base, create_tree_#res.offset; [L619] havoc create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, create_tree_#t~mem12.base, create_tree_#t~mem12.offset, create_tree_#t~mem13.base, create_tree_#t~mem13.offset, create_tree_#t~mem14.base, create_tree_#t~mem14.offset, create_tree_#t~mem15.base, create_tree_#t~mem15.offset, create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, create_tree_~node~0.offset; [L574] create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := 0, 0; [L575] create_tree_~node~0.base, create_tree_~node~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~nondet7=-1, create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0] [L576-L587] assume !!(0 != create_tree_#t~nondet7); [L576] havoc create_tree_#t~nondet7; [L577] call create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset := #Ultimate.alloc(16); [L577] create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset; [L578-L579] assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0); [L580] call write~$Pointer$(0, 0, create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L581] call write~$Pointer$(create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4); [L582-L583] assume !(create_tree_~nodelast~0.base != 0 || create_tree_~nodelast~0.offset != 0); [L584] assume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647; [L584] create_tree_~value~0 := create_tree_#t~nondet9; [L584] havoc create_tree_#t~nondet9; [L585] call write~int(create_tree_~value~0, create_tree_~node~0.base, 12 + create_tree_~node~0.offset, 4); [L586] create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := create_tree_~node~0.base, create_tree_~node~0.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_#t~nondet7=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L576-L587] assume !(0 != create_tree_#t~nondet7); [L576] havoc create_tree_#t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L588-L597] assume !!(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0); [L589] call create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset := #Ultimate.alloc(16); [L589] call write~$Pointer$(create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L590-L591] assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0); [L592] call create_tree_#t~mem11.base, create_tree_#t~mem11.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L592] call write~$Pointer$(0, 0, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, 4); [L592] havoc create_tree_#t~mem11.base, create_tree_#t~mem11.offset; [L593] call create_tree_#t~mem12.base, create_tree_#t~mem12.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L593] call write~$Pointer$(0, 0, create_tree_#t~mem12.base, 4 + create_tree_#t~mem12.offset, 4); [L593] havoc create_tree_#t~mem12.base, create_tree_#t~mem12.offset; [L594] call create_tree_#t~mem13.base, create_tree_#t~mem13.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L594] call write~int(42, create_tree_#t~mem13.base, 12 + create_tree_#t~mem13.offset, 4); [L594] havoc create_tree_#t~mem13.base, create_tree_#t~mem13.offset; [L595] call create_tree_#t~mem14.base, create_tree_#t~mem14.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L595] call write~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, create_tree_#t~mem14.base, 8 + create_tree_#t~mem14.offset, 4); [L595] havoc create_tree_#t~mem14.base, create_tree_#t~mem14.offset; [L596] call create_tree_#t~mem15.base, create_tree_#t~mem15.offset := read~$Pointer$(create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4); [L596] create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~mem15.base, create_tree_#t~mem15.offset; [L596] havoc create_tree_#t~mem15.base, create_tree_#t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L588-L597] assume !(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0); [L598] create_tree_#res.base, create_tree_#res.offset := create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset; [L619] main_#t~ret23.base, main_#t~ret23.offset := create_tree_#res.base, create_tree_#res.offset; [L619] main_~data~0.base, main_~data~0.offset := main_#t~ret23.base, main_#t~ret23.offset; [L619] havoc main_#t~ret23.base, main_#t~ret23.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, main_~data~0.base=3, main_~data~0.offset=0] [L620-L621] assume !(main_~data~0.base == 0 && main_~data~0.offset == 0); [L622] inspect_#in~node.base, inspect_#in~node.offset := main_~data~0.base, main_~data~0.offset; [L622] havoc inspect_#t~mem2.base, inspect_#t~mem2.offset, inspect_#t~mem3.base, inspect_#t~mem3.offset, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6.base, inspect_#t~mem6.offset, inspect_~node.base, inspect_~node.offset; [L562-L571] inspect_~node.base, inspect_~node.offset := inspect_#in~node.base, inspect_#in~node.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L564] assume !(inspect_~node.base == 0 && inspect_~node.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L565-L570] assume !!(inspect_~node.base != 0 || inspect_~node.offset != 0); [L566] call inspect_#t~mem2.base, inspect_#t~mem2.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem2.base=10, inspect_#t~mem2.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L566-L567] assume inspect_#t~mem2.base != 0 || inspect_#t~mem2.offset != 0; [L566] havoc inspect_#t~mem2.base, inspect_#t~mem2.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L567] call inspect_#t~mem3.base, inspect_#t~mem3.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); [L567] call inspect_#t~mem4 := read~int(inspect_#t~mem3.base, 12 + inspect_#t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem3.base=10, inspect_#t~mem3.offset=0, inspect_#t~mem4=42, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L567] assume !!(42 == inspect_#t~mem4); [L567] havoc inspect_#t~mem3.base, inspect_#t~mem3.offset; [L567] havoc inspect_#t~mem4; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] call inspect_#t~mem5 := read~int(inspect_~node.base, 12 + inspect_~node.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem5=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] assume 0 == inspect_#t~mem5; [L568] havoc inspect_#t~mem5; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret23, main_~data~0; [L619] havoc create_tree_#res; [L619] havoc create_tree_#t~malloc8, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10, create_tree_#t~mem11, create_tree_#t~mem12, create_tree_#t~mem13, create_tree_#t~mem14, create_tree_#t~mem15, create_tree_~nodelast~0, create_tree_~node~0; [L574] create_tree_~nodelast~0 := { base: 0, offset: 0 }; [L575] create_tree_~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, create_tree_~nodelast~0!base=0, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~nondet7=-1, create_tree_~nodelast~0!base=0, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != create_tree_#t~nondet7)) [L576] havoc create_tree_#t~nondet7; [L577] FCALL call create_tree_#t~malloc8 := #Ultimate.alloc(16); [L577] create_tree_~node~0 := create_tree_#t~malloc8; [L578] COND FALSE !(create_tree_~node~0 == { base: 0, offset: 0 }) [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(create_tree_~nodelast~0, { base: create_tree_~node~0!base, offset: 4 + create_tree_~node~0!offset }, 4); [L582-L583] COND FALSE !(create_tree_~nodelast~0 != { base: 0, offset: 0 }) [L584] assume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647; [L584] create_tree_~value~0 := create_tree_#t~nondet9; [L584] havoc create_tree_#t~nondet9; [L585] FCALL call write~int(create_tree_~value~0, { base: create_tree_~node~0!base, offset: 12 + create_tree_~node~0!offset }, 4); [L586] create_tree_~nodelast~0 := create_tree_~node~0; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_#t~nondet7=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L576-L587] COND TRUE !(0 != create_tree_#t~nondet7) [L576] havoc create_tree_#t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L588-L597] COND FALSE !(!(create_tree_~node~0 != { base: 0, offset: 0 })) [L589] FCALL call create_tree_#t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(create_tree_#t~malloc10, { base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L590] COND FALSE !(create_tree_~node~0 == { base: 0, offset: 0 }) [L592] FCALL call create_tree_#t~mem11 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_#t~mem11!base, offset: create_tree_#t~mem11!offset }, 4); [L592] havoc create_tree_#t~mem11; [L593] FCALL call create_tree_#t~mem12 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_#t~mem12!base, offset: 4 + create_tree_#t~mem12!offset }, 4); [L593] havoc create_tree_#t~mem12; [L594] FCALL call create_tree_#t~mem13 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: create_tree_#t~mem13!base, offset: 12 + create_tree_#t~mem13!offset }, 4); [L594] havoc create_tree_#t~mem13; [L595] FCALL call create_tree_#t~mem14 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(create_tree_~node~0, { base: create_tree_#t~mem14!base, offset: 8 + create_tree_#t~mem14!offset }, 4); [L595] havoc create_tree_#t~mem14; [L596] FCALL call create_tree_#t~mem15 := read~$Pointer$({ base: create_tree_~node~0!base, offset: 4 + create_tree_~node~0!offset }, 4); [L596] create_tree_~node~0 := create_tree_#t~mem15; [L596] havoc create_tree_#t~mem15; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L588-L597] COND TRUE !(create_tree_~node~0 != { base: 0, offset: 0 }) [L598] create_tree_#res := create_tree_~nodelast~0; [L619] main_#t~ret23 := create_tree_#res; [L619] main_~data~0 := main_#t~ret23; [L619] havoc main_#t~ret23; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, main_~data~0!base=3, main_~data~0!offset=0] [L620] COND FALSE !(main_~data~0 == { base: 0, offset: 0 }) [L622] inspect_#in~node := main_~data~0; [L622] havoc inspect_#t~mem2, inspect_#t~mem3, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6, inspect_~node; [L562-L571] inspect_~node := inspect_#in~node; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L564] COND FALSE !(inspect_~node == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L565-L570] COND FALSE !(!(inspect_~node != { base: 0, offset: 0 })) [L566] FCALL call inspect_#t~mem2 := read~$Pointer$({ base: inspect_~node!base, offset: inspect_~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem2!base=10, inspect_#t~mem2!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L566-L567] COND TRUE inspect_#t~mem2 != { base: 0, offset: 0 } [L566] havoc inspect_#t~mem2; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L567] FCALL call inspect_#t~mem3 := read~$Pointer$({ base: inspect_~node!base, offset: inspect_~node!offset }, 4); [L567] FCALL call inspect_#t~mem4 := read~int({ base: inspect_#t~mem3!base, offset: 12 + inspect_#t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem3!base=10, inspect_#t~mem3!offset=0, inspect_#t~mem4=42, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L567] COND FALSE !(!(42 == inspect_#t~mem4)) [L567] havoc inspect_#t~mem3; [L567] havoc inspect_#t~mem4; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] FCALL call inspect_#t~mem5 := read~int({ base: inspect_~node!base, offset: 12 + inspect_~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem5=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] COND TRUE 0 == inspect_#t~mem5 [L568] havoc inspect_#t~mem5; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret23, main_~data~0; [L619] havoc create_tree_#res; [L619] havoc create_tree_#t~malloc8, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10, create_tree_#t~mem11, create_tree_#t~mem12, create_tree_#t~mem13, create_tree_#t~mem14, create_tree_#t~mem15, create_tree_~nodelast~0, create_tree_~node~0; [L574] create_tree_~nodelast~0 := { base: 0, offset: 0 }; [L575] create_tree_~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, create_tree_~nodelast~0!base=0, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~nondet7=-1, create_tree_~nodelast~0!base=0, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != create_tree_#t~nondet7)) [L576] havoc create_tree_#t~nondet7; [L577] FCALL call create_tree_#t~malloc8 := #Ultimate.alloc(16); [L577] create_tree_~node~0 := create_tree_#t~malloc8; [L578] COND FALSE !(create_tree_~node~0 == { base: 0, offset: 0 }) [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(create_tree_~nodelast~0, { base: create_tree_~node~0!base, offset: 4 + create_tree_~node~0!offset }, 4); [L582-L583] COND FALSE !(create_tree_~nodelast~0 != { base: 0, offset: 0 }) [L584] assume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647; [L584] create_tree_~value~0 := create_tree_#t~nondet9; [L584] havoc create_tree_#t~nondet9; [L585] FCALL call write~int(create_tree_~value~0, { base: create_tree_~node~0!base, offset: 12 + create_tree_~node~0!offset }, 4); [L586] create_tree_~nodelast~0 := create_tree_~node~0; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_#t~nondet7=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L576-L587] COND TRUE !(0 != create_tree_#t~nondet7) [L576] havoc create_tree_#t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L588-L597] COND FALSE !(!(create_tree_~node~0 != { base: 0, offset: 0 })) [L589] FCALL call create_tree_#t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(create_tree_#t~malloc10, { base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L590] COND FALSE !(create_tree_~node~0 == { base: 0, offset: 0 }) [L592] FCALL call create_tree_#t~mem11 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_#t~mem11!base, offset: create_tree_#t~mem11!offset }, 4); [L592] havoc create_tree_#t~mem11; [L593] FCALL call create_tree_#t~mem12 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_#t~mem12!base, offset: 4 + create_tree_#t~mem12!offset }, 4); [L593] havoc create_tree_#t~mem12; [L594] FCALL call create_tree_#t~mem13 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: create_tree_#t~mem13!base, offset: 12 + create_tree_#t~mem13!offset }, 4); [L594] havoc create_tree_#t~mem13; [L595] FCALL call create_tree_#t~mem14 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(create_tree_~node~0, { base: create_tree_#t~mem14!base, offset: 8 + create_tree_#t~mem14!offset }, 4); [L595] havoc create_tree_#t~mem14; [L596] FCALL call create_tree_#t~mem15 := read~$Pointer$({ base: create_tree_~node~0!base, offset: 4 + create_tree_~node~0!offset }, 4); [L596] create_tree_~node~0 := create_tree_#t~mem15; [L596] havoc create_tree_#t~mem15; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L588-L597] COND TRUE !(create_tree_~node~0 != { base: 0, offset: 0 }) [L598] create_tree_#res := create_tree_~nodelast~0; [L619] main_#t~ret23 := create_tree_#res; [L619] main_~data~0 := main_#t~ret23; [L619] havoc main_#t~ret23; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, main_~data~0!base=3, main_~data~0!offset=0] [L620] COND FALSE !(main_~data~0 == { base: 0, offset: 0 }) [L622] inspect_#in~node := main_~data~0; [L622] havoc inspect_#t~mem2, inspect_#t~mem3, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6, inspect_~node; [L562-L571] inspect_~node := inspect_#in~node; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L564] COND FALSE !(inspect_~node == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L565-L570] COND FALSE !(!(inspect_~node != { base: 0, offset: 0 })) [L566] FCALL call inspect_#t~mem2 := read~$Pointer$({ base: inspect_~node!base, offset: inspect_~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem2!base=10, inspect_#t~mem2!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L566-L567] COND TRUE inspect_#t~mem2 != { base: 0, offset: 0 } [L566] havoc inspect_#t~mem2; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L567] FCALL call inspect_#t~mem3 := read~$Pointer$({ base: inspect_~node!base, offset: inspect_~node!offset }, 4); [L567] FCALL call inspect_#t~mem4 := read~int({ base: inspect_#t~mem3!base, offset: 12 + inspect_#t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem3!base=10, inspect_#t~mem3!offset=0, inspect_#t~mem4=42, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L567] COND FALSE !(!(42 == inspect_#t~mem4)) [L567] havoc inspect_#t~mem3; [L567] havoc inspect_#t~mem4; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] FCALL call inspect_#t~mem5 := read~int({ base: inspect_~node!base, offset: 12 + inspect_~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem5=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] COND TRUE 0 == inspect_#t~mem5 [L568] havoc inspect_#t~mem5; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) [L598] #res := ~nodelast~0; [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) [L562-L571] ~node := #in~node; VAL [#NULL!base=0, #NULL!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) [L598] #res := ~nodelast~0; [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) [L562-L571] ~node := #in~node; VAL [#NULL!base=0, #NULL!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) [L578] COND FALSE !(!node) [L580] node->left = ((void *)0) [L581] node->right = nodelast [L582] COND FALSE !(\read(*nodelast)) [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value [L586] nodelast = node [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) [L590] COND FALSE !(!node) [L592] EXPR node->left [L592] node->left->left = ((void *)0) [L593] EXPR node->left [L593] node->left->right = ((void *)0) [L594] EXPR node->left [L594] node->left->value = 42 [L595] EXPR node->left [L595] node->left->parent = node [L596] EXPR node->right [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) [L598] return nodelast; [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) [L564] COND FALSE !(!(node)) [L565] COND TRUE node != ((void *)0) [L566] node->left [L566] COND TRUE node->left [L567] EXPR node->left [L567] EXPR node->left->value [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value [L568] COND TRUE !(node->value) [L568] CALL fail() [L554] __VERIFIER_error() ----- [2018-11-23 13:15:48,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:15:48 ImpRootNode [2018-11-23 13:15:48,004 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 13:15:48,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:15:48,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:15:48,004 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:15:48,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:38" (3/4) ... [2018-11-23 13:15:48,007 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~ret23.base, main_#t~ret23.offset, main_~data~0.base, main_~data~0.offset;havoc create_tree_#res.base, create_tree_#res.offset;havoc create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, create_tree_#t~mem12.base, create_tree_#t~mem12.offset, create_tree_#t~mem13.base, create_tree_#t~mem13.offset, create_tree_#t~mem14.base, create_tree_#t~mem14.offset, create_tree_#t~mem15.base, create_tree_#t~mem15.offset, create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, create_tree_~node~0.offset;create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := 0, 0;create_tree_~node~0.base, create_tree_~node~0.offset := 0, 0; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=0, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=0, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~nondet7|=(- 1)] [?] assume !!(0 != create_tree_#t~nondet7);havoc create_tree_#t~nondet7;call create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset := #Ultimate.alloc(16);create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset;BeginParallelComposition{ParallelCodeBlock0: assume create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0;assume false;ParallelCodeBlock1: assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0);}EndParallelCompositioncall write~$Pointer$(0, 0, create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~$Pointer$(create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4);BeginParallelComposition{ParallelCodeBlock0: assume create_tree_~nodelast~0.base != 0 || create_tree_~nodelast~0.offset != 0;call write~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, create_tree_~nodelast~0.base, 8 + create_tree_~nodelast~0.offset, 4);ParallelCodeBlock1: assume !(create_tree_~nodelast~0.base != 0 || create_tree_~nodelast~0.offset != 0);}EndParallelCompositionassume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647;create_tree_~value~0 := create_tree_#t~nondet9;havoc create_tree_#t~nondet9;call write~int(create_tree_~value~0, create_tree_~node~0.base, 12 + create_tree_~node~0.offset, 4);create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := create_tree_~node~0.base, create_tree_~node~0.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=3, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0] [?] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=3, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_create_tree_#t~nondet7|=0] [?] assume !(0 != create_tree_#t~nondet7);havoc create_tree_#t~nondet7; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=3, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0] [?] assume !!(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0);call create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset := #Ultimate.alloc(16);call write~$Pointer$(create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_~node~0.base, create_tree_~node~0.offset, 4);BeginParallelComposition{ParallelCodeBlock0: assume create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0;assume false;ParallelCodeBlock1: assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0);}EndParallelCompositioncall create_tree_#t~mem11.base, create_tree_#t~mem11.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~$Pointer$(0, 0, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, 4);havoc create_tree_#t~mem11.base, create_tree_#t~mem11.offset;call create_tree_#t~mem12.base, create_tree_#t~mem12.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~$Pointer$(0, 0, create_tree_#t~mem12.base, 4 + create_tree_#t~mem12.offset, 4);havoc create_tree_#t~mem12.base, create_tree_#t~mem12.offset;call create_tree_#t~mem13.base, create_tree_#t~mem13.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~int(42, create_tree_#t~mem13.base, 12 + create_tree_#t~mem13.offset, 4);havoc create_tree_#t~mem13.base, create_tree_#t~mem13.offset;call create_tree_#t~mem14.base, create_tree_#t~mem14.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4);call write~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, create_tree_#t~mem14.base, 8 + create_tree_#t~mem14.offset, 4);havoc create_tree_#t~mem14.base, create_tree_#t~mem14.offset;call create_tree_#t~mem15.base, create_tree_#t~mem15.offset := read~$Pointer$(create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4);create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~mem15.base, create_tree_#t~mem15.offset;havoc create_tree_#t~mem15.base, create_tree_#t~mem15.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0);}EndParallelCompositioncreate_tree_#res.base, create_tree_#res.offset := create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset;main_#t~ret23.base, main_#t~ret23.offset := create_tree_#res.base, create_tree_#res.offset;main_~data~0.base, main_~data~0.offset := main_#t~ret23.base, main_#t~ret23.offset;havoc main_#t~ret23.base, main_#t~ret23.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0] [?] assume !(main_~data~0.base == 0 && main_~data~0.offset == 0);inspect_#in~node.base, inspect_#in~node.offset := main_~data~0.base, main_~data~0.offset;havoc inspect_#t~mem2.base, inspect_#t~mem2.offset, inspect_#t~mem3.base, inspect_#t~mem3.offset, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6.base, inspect_#t~mem6.offset, inspect_~node.base, inspect_~node.offset;inspect_~node.base, inspect_~node.offset := inspect_#in~node.base, inspect_#in~node.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] assume !(inspect_~node.base == 0 && inspect_~node.offset == 0); VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] goto; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] assume !!(inspect_~node.base != 0 || inspect_~node.offset != 0);call inspect_#t~mem2.base, inspect_#t~mem2.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0, |ULTIMATE.start_inspect_#t~mem2.base|=10, |ULTIMATE.start_inspect_#t~mem2.offset|=0] [?] assume inspect_#t~mem2.base != 0 || inspect_#t~mem2.offset != 0;havoc inspect_#t~mem2.base, inspect_#t~mem2.offset; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] call inspect_#t~mem3.base, inspect_#t~mem3.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4);call inspect_#t~mem4 := read~int(inspect_#t~mem3.base, 12 + inspect_#t~mem3.offset, 4); VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0, |ULTIMATE.start_inspect_#t~mem3.base|=10, |ULTIMATE.start_inspect_#t~mem3.offset|=0, |ULTIMATE.start_inspect_#t~mem4|=42] [?] assume !!(42 == inspect_#t~mem4);havoc inspect_#t~mem3.base, inspect_#t~mem3.offset;havoc inspect_#t~mem4; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] goto; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] call inspect_#t~mem5 := read~int(inspect_~node.base, 12 + inspect_~node.offset, 4); VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0, |ULTIMATE.start_inspect_#t~mem5|=0] [?] assume 0 == inspect_#t~mem5;havoc inspect_#t~mem5; VAL [ULTIMATE.start_create_tree_~nodelast~0.base=3, ULTIMATE.start_create_tree_~nodelast~0.offset=0, ULTIMATE.start_create_tree_~node~0.base=0, ULTIMATE.start_create_tree_~node~0.offset=0, ULTIMATE.start_create_tree_~value~0=0, ULTIMATE.start_inspect_~node.base=3, ULTIMATE.start_inspect_~node.offset=0, ULTIMATE.start_main_~data~0.base=3, ULTIMATE.start_main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_create_tree_#res.base|=3, |ULTIMATE.start_create_tree_#res.offset|=0, |ULTIMATE.start_create_tree_#t~malloc10.base|=10, |ULTIMATE.start_create_tree_#t~malloc10.offset|=0, |ULTIMATE.start_create_tree_#t~malloc8.base|=3, |ULTIMATE.start_create_tree_#t~malloc8.offset|=0, |ULTIMATE.start_inspect_#in~node.base|=3, |ULTIMATE.start_inspect_#in~node.offset|=0] [?] CALL call fail(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret23.base, main_#t~ret23.offset, main_~data~0.base, main_~data~0.offset; [L619] havoc create_tree_#res.base, create_tree_#res.offset; [L619] havoc create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, create_tree_#t~mem12.base, create_tree_#t~mem12.offset, create_tree_#t~mem13.base, create_tree_#t~mem13.offset, create_tree_#t~mem14.base, create_tree_#t~mem14.offset, create_tree_#t~mem15.base, create_tree_#t~mem15.offset, create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, create_tree_~node~0.offset; [L574] create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := 0, 0; [L575] create_tree_~node~0.base, create_tree_~node~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~nondet7=-1, create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0] [L576-L587] assume !!(0 != create_tree_#t~nondet7); [L576] havoc create_tree_#t~nondet7; [L577] call create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset := #Ultimate.alloc(16); [L577] create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset; [L578-L579] assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0); [L580] call write~$Pointer$(0, 0, create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L581] call write~$Pointer$(create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4); [L582-L583] assume !(create_tree_~nodelast~0.base != 0 || create_tree_~nodelast~0.offset != 0); [L584] assume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647; [L584] create_tree_~value~0 := create_tree_#t~nondet9; [L584] havoc create_tree_#t~nondet9; [L585] call write~int(create_tree_~value~0, create_tree_~node~0.base, 12 + create_tree_~node~0.offset, 4); [L586] create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := create_tree_~node~0.base, create_tree_~node~0.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_#t~nondet7=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L576-L587] assume !(0 != create_tree_#t~nondet7); [L576] havoc create_tree_#t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L588-L597] assume !!(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0); [L589] call create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset := #Ultimate.alloc(16); [L589] call write~$Pointer$(create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L590-L591] assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0); [L592] call create_tree_#t~mem11.base, create_tree_#t~mem11.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L592] call write~$Pointer$(0, 0, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, 4); [L592] havoc create_tree_#t~mem11.base, create_tree_#t~mem11.offset; [L593] call create_tree_#t~mem12.base, create_tree_#t~mem12.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L593] call write~$Pointer$(0, 0, create_tree_#t~mem12.base, 4 + create_tree_#t~mem12.offset, 4); [L593] havoc create_tree_#t~mem12.base, create_tree_#t~mem12.offset; [L594] call create_tree_#t~mem13.base, create_tree_#t~mem13.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L594] call write~int(42, create_tree_#t~mem13.base, 12 + create_tree_#t~mem13.offset, 4); [L594] havoc create_tree_#t~mem13.base, create_tree_#t~mem13.offset; [L595] call create_tree_#t~mem14.base, create_tree_#t~mem14.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L595] call write~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, create_tree_#t~mem14.base, 8 + create_tree_#t~mem14.offset, 4); [L595] havoc create_tree_#t~mem14.base, create_tree_#t~mem14.offset; [L596] call create_tree_#t~mem15.base, create_tree_#t~mem15.offset := read~$Pointer$(create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4); [L596] create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~mem15.base, create_tree_#t~mem15.offset; [L596] havoc create_tree_#t~mem15.base, create_tree_#t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L588-L597] assume !(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0); [L598] create_tree_#res.base, create_tree_#res.offset := create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset; [L619] main_#t~ret23.base, main_#t~ret23.offset := create_tree_#res.base, create_tree_#res.offset; [L619] main_~data~0.base, main_~data~0.offset := main_#t~ret23.base, main_#t~ret23.offset; [L619] havoc main_#t~ret23.base, main_#t~ret23.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, main_~data~0.base=3, main_~data~0.offset=0] [L620-L621] assume !(main_~data~0.base == 0 && main_~data~0.offset == 0); [L622] inspect_#in~node.base, inspect_#in~node.offset := main_~data~0.base, main_~data~0.offset; [L622] havoc inspect_#t~mem2.base, inspect_#t~mem2.offset, inspect_#t~mem3.base, inspect_#t~mem3.offset, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6.base, inspect_#t~mem6.offset, inspect_~node.base, inspect_~node.offset; [L562-L571] inspect_~node.base, inspect_~node.offset := inspect_#in~node.base, inspect_#in~node.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L564] assume !(inspect_~node.base == 0 && inspect_~node.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L565-L570] assume !!(inspect_~node.base != 0 || inspect_~node.offset != 0); [L566] call inspect_#t~mem2.base, inspect_#t~mem2.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem2.base=10, inspect_#t~mem2.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L566-L567] assume inspect_#t~mem2.base != 0 || inspect_#t~mem2.offset != 0; [L566] havoc inspect_#t~mem2.base, inspect_#t~mem2.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L567] call inspect_#t~mem3.base, inspect_#t~mem3.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); [L567] call inspect_#t~mem4 := read~int(inspect_#t~mem3.base, 12 + inspect_#t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem3.base=10, inspect_#t~mem3.offset=0, inspect_#t~mem4=42, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L567] assume !!(42 == inspect_#t~mem4); [L567] havoc inspect_#t~mem3.base, inspect_#t~mem3.offset; [L567] havoc inspect_#t~mem4; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] call inspect_#t~mem5 := read~int(inspect_~node.base, 12 + inspect_~node.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem5=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] assume 0 == inspect_#t~mem5; [L568] havoc inspect_#t~mem5; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret23.base, main_#t~ret23.offset, main_~data~0.base, main_~data~0.offset; [L619] havoc create_tree_#res.base, create_tree_#res.offset; [L619] havoc create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, create_tree_#t~mem12.base, create_tree_#t~mem12.offset, create_tree_#t~mem13.base, create_tree_#t~mem13.offset, create_tree_#t~mem14.base, create_tree_#t~mem14.offset, create_tree_#t~mem15.base, create_tree_#t~mem15.offset, create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, create_tree_~node~0.offset; [L574] create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := 0, 0; [L575] create_tree_~node~0.base, create_tree_~node~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~nondet7=-1, create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0] [L576-L587] assume !!(0 != create_tree_#t~nondet7); [L576] havoc create_tree_#t~nondet7; [L577] call create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset := #Ultimate.alloc(16); [L577] create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~malloc8.base, create_tree_#t~malloc8.offset; [L578-L579] assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0); [L580] call write~$Pointer$(0, 0, create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L581] call write~$Pointer$(create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset, create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4); [L582-L583] assume !(create_tree_~nodelast~0.base != 0 || create_tree_~nodelast~0.offset != 0); [L584] assume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647; [L584] create_tree_~value~0 := create_tree_#t~nondet9; [L584] havoc create_tree_#t~nondet9; [L585] call write~int(create_tree_~value~0, create_tree_~node~0.base, 12 + create_tree_~node~0.offset, 4); [L586] create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset := create_tree_~node~0.base, create_tree_~node~0.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_#t~nondet7=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L576-L587] assume !(0 != create_tree_#t~nondet7); [L576] havoc create_tree_#t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=3, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L588-L597] assume !!(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0); [L589] call create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset := #Ultimate.alloc(16); [L589] call write~$Pointer$(create_tree_#t~malloc10.base, create_tree_#t~malloc10.offset, create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L590-L591] assume !(create_tree_~node~0.base == 0 && create_tree_~node~0.offset == 0); [L592] call create_tree_#t~mem11.base, create_tree_#t~mem11.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L592] call write~$Pointer$(0, 0, create_tree_#t~mem11.base, create_tree_#t~mem11.offset, 4); [L592] havoc create_tree_#t~mem11.base, create_tree_#t~mem11.offset; [L593] call create_tree_#t~mem12.base, create_tree_#t~mem12.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L593] call write~$Pointer$(0, 0, create_tree_#t~mem12.base, 4 + create_tree_#t~mem12.offset, 4); [L593] havoc create_tree_#t~mem12.base, create_tree_#t~mem12.offset; [L594] call create_tree_#t~mem13.base, create_tree_#t~mem13.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L594] call write~int(42, create_tree_#t~mem13.base, 12 + create_tree_#t~mem13.offset, 4); [L594] havoc create_tree_#t~mem13.base, create_tree_#t~mem13.offset; [L595] call create_tree_#t~mem14.base, create_tree_#t~mem14.offset := read~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, 4); [L595] call write~$Pointer$(create_tree_~node~0.base, create_tree_~node~0.offset, create_tree_#t~mem14.base, 8 + create_tree_#t~mem14.offset, 4); [L595] havoc create_tree_#t~mem14.base, create_tree_#t~mem14.offset; [L596] call create_tree_#t~mem15.base, create_tree_#t~mem15.offset := read~$Pointer$(create_tree_~node~0.base, 4 + create_tree_~node~0.offset, 4); [L596] create_tree_~node~0.base, create_tree_~node~0.offset := create_tree_#t~mem15.base, create_tree_#t~mem15.offset; [L596] havoc create_tree_#t~mem15.base, create_tree_#t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0] [L588-L597] assume !(create_tree_~node~0.base != 0 || create_tree_~node~0.offset != 0); [L598] create_tree_#res.base, create_tree_#res.offset := create_tree_~nodelast~0.base, create_tree_~nodelast~0.offset; [L619] main_#t~ret23.base, main_#t~ret23.offset := create_tree_#res.base, create_tree_#res.offset; [L619] main_~data~0.base, main_~data~0.offset := main_#t~ret23.base, main_#t~ret23.offset; [L619] havoc main_#t~ret23.base, main_#t~ret23.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, main_~data~0.base=3, main_~data~0.offset=0] [L620-L621] assume !(main_~data~0.base == 0 && main_~data~0.offset == 0); [L622] inspect_#in~node.base, inspect_#in~node.offset := main_~data~0.base, main_~data~0.offset; [L622] havoc inspect_#t~mem2.base, inspect_#t~mem2.offset, inspect_#t~mem3.base, inspect_#t~mem3.offset, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6.base, inspect_#t~mem6.offset, inspect_~node.base, inspect_~node.offset; [L562-L571] inspect_~node.base, inspect_~node.offset := inspect_#in~node.base, inspect_#in~node.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L564] assume !(inspect_~node.base == 0 && inspect_~node.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L565-L570] assume !!(inspect_~node.base != 0 || inspect_~node.offset != 0); [L566] call inspect_#t~mem2.base, inspect_#t~mem2.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem2.base=10, inspect_#t~mem2.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L566-L567] assume inspect_#t~mem2.base != 0 || inspect_#t~mem2.offset != 0; [L566] havoc inspect_#t~mem2.base, inspect_#t~mem2.offset; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L567] call inspect_#t~mem3.base, inspect_#t~mem3.offset := read~$Pointer$(inspect_~node.base, inspect_~node.offset, 4); [L567] call inspect_#t~mem4 := read~int(inspect_#t~mem3.base, 12 + inspect_#t~mem3.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem3.base=10, inspect_#t~mem3.offset=0, inspect_#t~mem4=42, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L567] assume !!(42 == inspect_#t~mem4); [L567] havoc inspect_#t~mem3.base, inspect_#t~mem3.offset; [L567] havoc inspect_#t~mem4; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] call inspect_#t~mem5 := read~int(inspect_~node.base, 12 + inspect_~node.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_#t~mem5=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] assume 0 == inspect_#t~mem5; [L568] havoc inspect_#t~mem5; VAL [#NULL.base=0, #NULL.offset=0, create_tree_#res.base=3, create_tree_#res.offset=0, create_tree_#t~malloc10.base=10, create_tree_#t~malloc10.offset=0, create_tree_#t~malloc8.base=3, create_tree_#t~malloc8.offset=0, create_tree_~nodelast~0.base=3, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, inspect_#in~node.base=3, inspect_#in~node.offset=0, inspect_~node.base=3, inspect_~node.offset=0, main_~data~0.base=3, main_~data~0.offset=0] [L568] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret23, main_~data~0; [L619] havoc create_tree_#res; [L619] havoc create_tree_#t~malloc8, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10, create_tree_#t~mem11, create_tree_#t~mem12, create_tree_#t~mem13, create_tree_#t~mem14, create_tree_#t~mem15, create_tree_~nodelast~0, create_tree_~node~0; [L574] create_tree_~nodelast~0 := { base: 0, offset: 0 }; [L575] create_tree_~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, create_tree_~nodelast~0!base=0, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~nondet7=-1, create_tree_~nodelast~0!base=0, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != create_tree_#t~nondet7)) [L576] havoc create_tree_#t~nondet7; [L577] FCALL call create_tree_#t~malloc8 := #Ultimate.alloc(16); [L577] create_tree_~node~0 := create_tree_#t~malloc8; [L578] COND FALSE !(create_tree_~node~0 == { base: 0, offset: 0 }) [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(create_tree_~nodelast~0, { base: create_tree_~node~0!base, offset: 4 + create_tree_~node~0!offset }, 4); [L582-L583] COND FALSE !(create_tree_~nodelast~0 != { base: 0, offset: 0 }) [L584] assume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647; [L584] create_tree_~value~0 := create_tree_#t~nondet9; [L584] havoc create_tree_#t~nondet9; [L585] FCALL call write~int(create_tree_~value~0, { base: create_tree_~node~0!base, offset: 12 + create_tree_~node~0!offset }, 4); [L586] create_tree_~nodelast~0 := create_tree_~node~0; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_#t~nondet7=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L576-L587] COND TRUE !(0 != create_tree_#t~nondet7) [L576] havoc create_tree_#t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L588-L597] COND FALSE !(!(create_tree_~node~0 != { base: 0, offset: 0 })) [L589] FCALL call create_tree_#t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(create_tree_#t~malloc10, { base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L590] COND FALSE !(create_tree_~node~0 == { base: 0, offset: 0 }) [L592] FCALL call create_tree_#t~mem11 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_#t~mem11!base, offset: create_tree_#t~mem11!offset }, 4); [L592] havoc create_tree_#t~mem11; [L593] FCALL call create_tree_#t~mem12 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_#t~mem12!base, offset: 4 + create_tree_#t~mem12!offset }, 4); [L593] havoc create_tree_#t~mem12; [L594] FCALL call create_tree_#t~mem13 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: create_tree_#t~mem13!base, offset: 12 + create_tree_#t~mem13!offset }, 4); [L594] havoc create_tree_#t~mem13; [L595] FCALL call create_tree_#t~mem14 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(create_tree_~node~0, { base: create_tree_#t~mem14!base, offset: 8 + create_tree_#t~mem14!offset }, 4); [L595] havoc create_tree_#t~mem14; [L596] FCALL call create_tree_#t~mem15 := read~$Pointer$({ base: create_tree_~node~0!base, offset: 4 + create_tree_~node~0!offset }, 4); [L596] create_tree_~node~0 := create_tree_#t~mem15; [L596] havoc create_tree_#t~mem15; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L588-L597] COND TRUE !(create_tree_~node~0 != { base: 0, offset: 0 }) [L598] create_tree_#res := create_tree_~nodelast~0; [L619] main_#t~ret23 := create_tree_#res; [L619] main_~data~0 := main_#t~ret23; [L619] havoc main_#t~ret23; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, main_~data~0!base=3, main_~data~0!offset=0] [L620] COND FALSE !(main_~data~0 == { base: 0, offset: 0 }) [L622] inspect_#in~node := main_~data~0; [L622] havoc inspect_#t~mem2, inspect_#t~mem3, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6, inspect_~node; [L562-L571] inspect_~node := inspect_#in~node; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L564] COND FALSE !(inspect_~node == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L565-L570] COND FALSE !(!(inspect_~node != { base: 0, offset: 0 })) [L566] FCALL call inspect_#t~mem2 := read~$Pointer$({ base: inspect_~node!base, offset: inspect_~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem2!base=10, inspect_#t~mem2!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L566-L567] COND TRUE inspect_#t~mem2 != { base: 0, offset: 0 } [L566] havoc inspect_#t~mem2; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L567] FCALL call inspect_#t~mem3 := read~$Pointer$({ base: inspect_~node!base, offset: inspect_~node!offset }, 4); [L567] FCALL call inspect_#t~mem4 := read~int({ base: inspect_#t~mem3!base, offset: 12 + inspect_#t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem3!base=10, inspect_#t~mem3!offset=0, inspect_#t~mem4=42, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L567] COND FALSE !(!(42 == inspect_#t~mem4)) [L567] havoc inspect_#t~mem3; [L567] havoc inspect_#t~mem4; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] FCALL call inspect_#t~mem5 := read~int({ base: inspect_~node!base, offset: 12 + inspect_~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem5=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] COND TRUE 0 == inspect_#t~mem5 [L568] havoc inspect_#t~mem5; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret23, main_~data~0; [L619] havoc create_tree_#res; [L619] havoc create_tree_#t~malloc8, create_tree_#t~nondet9, create_tree_~value~0, create_tree_#t~nondet7, create_tree_#t~malloc10, create_tree_#t~mem11, create_tree_#t~mem12, create_tree_#t~mem13, create_tree_#t~mem14, create_tree_#t~mem15, create_tree_~nodelast~0, create_tree_~node~0; [L574] create_tree_~nodelast~0 := { base: 0, offset: 0 }; [L575] create_tree_~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, create_tree_~nodelast~0!base=0, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~nondet7=-1, create_tree_~nodelast~0!base=0, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != create_tree_#t~nondet7)) [L576] havoc create_tree_#t~nondet7; [L577] FCALL call create_tree_#t~malloc8 := #Ultimate.alloc(16); [L577] create_tree_~node~0 := create_tree_#t~malloc8; [L578] COND FALSE !(create_tree_~node~0 == { base: 0, offset: 0 }) [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(create_tree_~nodelast~0, { base: create_tree_~node~0!base, offset: 4 + create_tree_~node~0!offset }, 4); [L582-L583] COND FALSE !(create_tree_~nodelast~0 != { base: 0, offset: 0 }) [L584] assume -2147483648 <= create_tree_#t~nondet9 && create_tree_#t~nondet9 <= 2147483647; [L584] create_tree_~value~0 := create_tree_#t~nondet9; [L584] havoc create_tree_#t~nondet9; [L585] FCALL call write~int(create_tree_~value~0, { base: create_tree_~node~0!base, offset: 12 + create_tree_~node~0!offset }, 4); [L586] create_tree_~nodelast~0 := create_tree_~node~0; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L576] assume -2147483648 <= create_tree_#t~nondet7 && create_tree_#t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_#t~nondet7=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L576-L587] COND TRUE !(0 != create_tree_#t~nondet7) [L576] havoc create_tree_#t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=3, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L588-L597] COND FALSE !(!(create_tree_~node~0 != { base: 0, offset: 0 })) [L589] FCALL call create_tree_#t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(create_tree_#t~malloc10, { base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L590] COND FALSE !(create_tree_~node~0 == { base: 0, offset: 0 }) [L592] FCALL call create_tree_#t~mem11 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_#t~mem11!base, offset: create_tree_#t~mem11!offset }, 4); [L592] havoc create_tree_#t~mem11; [L593] FCALL call create_tree_#t~mem12 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: create_tree_#t~mem12!base, offset: 4 + create_tree_#t~mem12!offset }, 4); [L593] havoc create_tree_#t~mem12; [L594] FCALL call create_tree_#t~mem13 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: create_tree_#t~mem13!base, offset: 12 + create_tree_#t~mem13!offset }, 4); [L594] havoc create_tree_#t~mem13; [L595] FCALL call create_tree_#t~mem14 := read~$Pointer$({ base: create_tree_~node~0!base, offset: create_tree_~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(create_tree_~node~0, { base: create_tree_#t~mem14!base, offset: 8 + create_tree_#t~mem14!offset }, 4); [L595] havoc create_tree_#t~mem14; [L596] FCALL call create_tree_#t~mem15 := read~$Pointer$({ base: create_tree_~node~0!base, offset: 4 + create_tree_~node~0!offset }, 4); [L596] create_tree_~node~0 := create_tree_#t~mem15; [L596] havoc create_tree_#t~mem15; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0] [L588-L597] COND TRUE !(create_tree_~node~0 != { base: 0, offset: 0 }) [L598] create_tree_#res := create_tree_~nodelast~0; [L619] main_#t~ret23 := create_tree_#res; [L619] main_~data~0 := main_#t~ret23; [L619] havoc main_#t~ret23; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, main_~data~0!base=3, main_~data~0!offset=0] [L620] COND FALSE !(main_~data~0 == { base: 0, offset: 0 }) [L622] inspect_#in~node := main_~data~0; [L622] havoc inspect_#t~mem2, inspect_#t~mem3, inspect_#t~mem4, inspect_#t~mem5, inspect_#t~mem6, inspect_~node; [L562-L571] inspect_~node := inspect_#in~node; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L564] COND FALSE !(inspect_~node == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L565-L570] COND FALSE !(!(inspect_~node != { base: 0, offset: 0 })) [L566] FCALL call inspect_#t~mem2 := read~$Pointer$({ base: inspect_~node!base, offset: inspect_~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem2!base=10, inspect_#t~mem2!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L566-L567] COND TRUE inspect_#t~mem2 != { base: 0, offset: 0 } [L566] havoc inspect_#t~mem2; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L567] FCALL call inspect_#t~mem3 := read~$Pointer$({ base: inspect_~node!base, offset: inspect_~node!offset }, 4); [L567] FCALL call inspect_#t~mem4 := read~int({ base: inspect_#t~mem3!base, offset: 12 + inspect_#t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem3!base=10, inspect_#t~mem3!offset=0, inspect_#t~mem4=42, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L567] COND FALSE !(!(42 == inspect_#t~mem4)) [L567] havoc inspect_#t~mem3; [L567] havoc inspect_#t~mem4; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] FCALL call inspect_#t~mem5 := read~int({ base: inspect_~node!base, offset: 12 + inspect_~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_#t~mem5=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] COND TRUE 0 == inspect_#t~mem5 [L568] havoc inspect_#t~mem5; VAL [#NULL!base=0, #NULL!offset=0, create_tree_#res!base=3, create_tree_#res!offset=0, create_tree_#t~malloc10!base=10, create_tree_#t~malloc10!offset=0, create_tree_#t~malloc8!base=3, create_tree_#t~malloc8!offset=0, create_tree_~nodelast~0!base=3, create_tree_~nodelast~0!offset=0, create_tree_~node~0!base=0, create_tree_~node~0!offset=0, create_tree_~value~0=0, inspect_#in~node!base=3, inspect_#in~node!offset=0, inspect_~node!base=3, inspect_~node!offset=0, main_~data~0!base=3, main_~data~0!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) [L598] #res := ~nodelast~0; [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) [L562-L571] ~node := #in~node; VAL [#NULL!base=0, #NULL!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) [L598] #res := ~nodelast~0; [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) [L562-L571] ~node := #in~node; VAL [#NULL!base=0, #NULL!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) [L578] COND FALSE !(!node) [L580] node->left = ((void *)0) [L581] node->right = nodelast [L582] COND FALSE !(\read(*nodelast)) [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value [L586] nodelast = node [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) [L590] COND FALSE !(!node) [L592] EXPR node->left [L592] node->left->left = ((void *)0) [L593] EXPR node->left [L593] node->left->right = ((void *)0) [L594] EXPR node->left [L594] node->left->value = 42 [L595] EXPR node->left [L595] node->left->parent = node [L596] EXPR node->right [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) [L598] return nodelast; [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) [L564] COND FALSE !(!(node)) [L565] COND TRUE node != ((void *)0) [L566] node->left [L566] COND TRUE node->left [L567] EXPR node->left [L567] EXPR node->left->value [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value [L568] COND TRUE !(node->value) [L568] CALL fail() [L554] __VERIFIER_error() ----- [2018-11-23 13:15:48,160 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_074daa64-309c-4dda-a6a9-d62aab693f51/bin-2019/ukojak/witness.graphml [2018-11-23 13:15:48,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:15:48,161 INFO L168 Benchmark]: Toolchain (without parser) took 10238.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:15:48,163 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:15:48,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:15:48,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:15:48,163 INFO L168 Benchmark]: Boogie Preprocessor took 25.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:15:48,164 INFO L168 Benchmark]: RCFGBuilder took 557.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:15:48,164 INFO L168 Benchmark]: CodeCheck took 9083.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -49.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:15:48,164 INFO L168 Benchmark]: Witness Printer took 156.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:15:48,167 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 45 locations, 1 error locations. UNSAFE Result, 9.0s OverallTime, 13 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42560 SDtfs, 19852 SDslu, 25708 SDs, 0 SdLazy, 58862 SolverSat, 22506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1713 GetRequests, 1553 SyntacticMatches, 40 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4760 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 24378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 17/36 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) [L578] COND FALSE !(!node) [L580] node->left = ((void *)0) [L581] node->right = nodelast [L582] COND FALSE !(\read(*nodelast)) [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value [L586] nodelast = node [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) [L590] COND FALSE !(!node) [L592] EXPR node->left [L592] node->left->left = ((void *)0) [L593] EXPR node->left [L593] node->left->right = ((void *)0) [L594] EXPR node->left [L594] node->left->value = 42 [L595] EXPR node->left [L595] node->left->parent = node [L596] EXPR node->right [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) [L598] return nodelast; [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) [L564] COND FALSE !(!(node)) [L565] COND TRUE node != ((void *)0) [L566] node->left [L566] COND TRUE node->left [L567] EXPR node->left [L567] EXPR node->left->value [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value [L568] COND TRUE !(node->value) [L568] CALL fail() [L554] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 557.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. * CodeCheck took 9083.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -49.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Witness Printer took 156.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...