./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b677e0cdf35fdc8eada9522ef5e29b8173f39a0f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:20:09,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:20:09,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:20:09,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:20:09,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:20:09,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:20:09,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:20:09,793 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:20:09,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:20:09,795 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:20:09,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:20:09,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:20:09,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:20:09,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:20:09,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:20:09,798 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:20:09,799 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:20:09,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:20:09,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:20:09,803 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:20:09,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:20:09,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:20:09,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:20:09,806 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:20:09,806 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:20:09,807 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:20:09,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:20:09,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:20:09,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:20:09,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:20:09,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:20:09,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:20:09,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:20:09,811 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:20:09,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:20:09,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:20:09,812 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 03:20:09,823 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:20:09,823 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:20:09,824 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:20:09,824 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:20:09,824 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:20:09,824 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:20:09,824 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:20:09,825 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:20:09,825 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:20:09,825 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:20:09,825 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:20:09,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:20:09,825 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:20:09,826 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:20:09,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:20:09,826 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:20:09,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:20:09,826 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:20:09,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:20:09,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:20:09,827 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:20:09,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:20:09,828 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:20:09,829 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:20:09,829 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:20:09,829 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:20:09,829 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:20:09,829 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:20:09,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:20:09,830 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:20:09,830 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:20:09,830 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:20:09,831 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer 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(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> b677e0cdf35fdc8eada9522ef5e29b8173f39a0f [2018-11-23 03:20:09,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:20:09,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:20:09,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:20:09,870 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:20:09,870 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:20:09,870 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-11-23 03:20:09,912 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/data/0fa8625ee/673757be5f5b48db884dc0e46b83f5db/FLAGd9a8f91e7 [2018-11-23 03:20:10,351 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:20:10,352 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/sv-benchmarks/c/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-11-23 03:20:10,358 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/data/0fa8625ee/673757be5f5b48db884dc0e46b83f5db/FLAGd9a8f91e7 [2018-11-23 03:20:10,368 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/data/0fa8625ee/673757be5f5b48db884dc0e46b83f5db [2018-11-23 03:20:10,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:20:10,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:20:10,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:20:10,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:20:10,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:20:10,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff2e354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10, skipping insertion in model container [2018-11-23 03:20:10,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:20:10,419 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:20:10,609 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:20:10,616 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:20:10,690 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:20:10,712 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:20:10,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10 WrapperNode [2018-11-23 03:20:10,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:20:10,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:20:10,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:20:10,713 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:20:10,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:20:10,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:20:10,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:20:10,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:20:10,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... [2018-11-23 03:20:10,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:20:10,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:20:10,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:20:10,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:20:10,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:20:10,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:20:10,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 03:20:10,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 03:20:10,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:20:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:20:10,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:20:11,061 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:20:11,061 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 03:20:11,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:20:11 BoogieIcfgContainer [2018-11-23 03:20:11,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:20:11,062 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:20:11,062 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:20:11,066 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:20:11,066 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:20:11,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:20:10" (1/3) ... [2018-11-23 03:20:11,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@451adadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:20:11, skipping insertion in model container [2018-11-23 03:20:11,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:20:11,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:10" (2/3) ... [2018-11-23 03:20:11,068 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@451adadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:20:11, skipping insertion in model container [2018-11-23 03:20:11,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:20:11,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:20:11" (3/3) ... [2018-11-23 03:20:11,069 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-11-23 03:20:11,106 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:20:11,106 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:20:11,106 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:20:11,107 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:20:11,107 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:20:11,107 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:20:11,107 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:20:11,107 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:20:11,107 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:20:11,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 03:20:11,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 03:20:11,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:20:11,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:20:11,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:20:11,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:20:11,133 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:20:11,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 03:20:11,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 03:20:11,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:20:11,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:20:11,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:20:11,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:20:11,139 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 18#L648-2true [2018-11-23 03:20:11,139 INFO L796 eck$LassoCheckResult]: Loop: 18#L648-2true assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 20#L637-2true assume !true; 7#L636-5true call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 6#L642true assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(12);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset;call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem13.base, 8 + main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset; 9#L642-2true call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 13#L648true assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~nondet15;havoc main_#t~mem14.base, main_#t~mem14.offset; 18#L648-2true [2018-11-23 03:20:11,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 03:20:11,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:20:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2018-11-23 03:20:11,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:20:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:20:11,247 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 03:20:11,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:20:11,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:20:11,251 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:20:11,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:20:11,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:20:11,262 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 03:20:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:20:11,268 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2018-11-23 03:20:11,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:20:11,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2018-11-23 03:20:11,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 03:20:11,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2018-11-23 03:20:11,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 03:20:11,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 03:20:11,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2018-11-23 03:20:11,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:20:11,276 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 03:20:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2018-11-23 03:20:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 03:20:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 03:20:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-11-23 03:20:11,300 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 03:20:11,300 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 03:20:11,300 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:20:11,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2018-11-23 03:20:11,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 03:20:11,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:20:11,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:20:11,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:20:11,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:20:11,302 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 62#L648-2 [2018-11-23 03:20:11,302 INFO L796 eck$LassoCheckResult]: Loop: 62#L648-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 65#L637-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 66#L636-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 50#L636-3 assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset; 51#L636-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 57#L642 assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(12);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset;call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem13.base, 8 + main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset; 58#L642-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 60#L648 assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~nondet15;havoc main_#t~mem14.base, main_#t~mem14.offset; 62#L648-2 [2018-11-23 03:20:11,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 03:20:11,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:20:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2018-11-23 03:20:11,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:20:11,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:20:11,405 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 03:20:11,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:20:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:20:11,405 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:20:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:20:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:20:11,406 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 03:20:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:20:11,506 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2018-11-23 03:20:11,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:20:11,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2018-11-23 03:20:11,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 03:20:11,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2018-11-23 03:20:11,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 03:20:11,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 03:20:11,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2018-11-23 03:20:11,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:20:11,510 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-11-23 03:20:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2018-11-23 03:20:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-11-23 03:20:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 03:20:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-23 03:20:11,514 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 03:20:11,514 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 03:20:11,514 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:20:11,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-23 03:20:11,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 03:20:11,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:20:11,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:20:11,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:20:11,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:20:11,515 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 114#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 115#L648-2 [2018-11-23 03:20:11,515 INFO L796 eck$LassoCheckResult]: Loop: 115#L648-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 118#L637-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 119#L636-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 101#L636-3 assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset; 102#L636-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 108#L642 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 109#L642-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 113#L648 assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~nondet15;havoc main_#t~mem14.base, main_#t~mem14.offset; 115#L648-2 [2018-11-23 03:20:11,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,516 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 03:20:11,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:20:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2018-11-23 03:20:11,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:20:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2018-11-23 03:20:11,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:20:11,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:20:11,638 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 03:20:11,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:20:11,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:20:11,763 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-23 03:20:11,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:20:11,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:20:11,820 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-23 03:20:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:20:11,933 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-11-23 03:20:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:20:11,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2018-11-23 03:20:11,935 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-23 03:20:11,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2018-11-23 03:20:11,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 03:20:11,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 03:20:11,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2018-11-23 03:20:11,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:20:11,936 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2018-11-23 03:20:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2018-11-23 03:20:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-11-23 03:20:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 03:20:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-11-23 03:20:11,939 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-23 03:20:11,939 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-23 03:20:11,939 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:20:11,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2018-11-23 03:20:11,939 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-23 03:20:11,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:20:11,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:20:11,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:20:11,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:20:11,940 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 181#L648-2 [2018-11-23 03:20:11,940 INFO L796 eck$LassoCheckResult]: Loop: 181#L648-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 192#L637-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 189#L636-1 assume !main_#t~short4; 190#L636-3 assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset; 195#L636-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L642 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 178#L642-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 179#L648 assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~nondet15;havoc main_#t~mem14.base, main_#t~mem14.offset; 181#L648-2 [2018-11-23 03:20:11,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-23 03:20:11,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:20:11,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2018-11-23 03:20:11,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:20:11,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:20:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2018-11-23 03:20:11,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:20:11,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:20:11,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:20:11,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:20:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:20:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- 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~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L630] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L630] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L630] havoc main_~n~0.base, main_~n~0.offset; [L631] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L632] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [L633] call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); ----- ----- 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~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L630] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L630] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L630] havoc main_~n~0.base, main_~n~0.offset; [L631] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L632] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [L633] call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~malloc16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~nondet1, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L630] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L630] main_~root~0 := main_#t~malloc0; [L630] havoc main_~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 8 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~malloc16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~nondet1, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L630] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L630] main_~root~0 := main_#t~malloc0; [L630] havoc main_~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 8 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L630] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L630] ~root~0 := #t~malloc0; [L630] havoc ~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 8 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L630] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L630] ~root~0 := #t~malloc0; [L630] havoc ~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 8 + ~root~0!offset }, 4); [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] root->left = ((void *)0) [L632] root->right = ((void *)0) [L633] root->parent = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~nondet15;havoc main_#t~mem14.base, main_#t~mem14.offset; [L634-L654] assume !!(0 != main_#t~nondet1); [L634] havoc main_#t~nondet1; [L635] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L636] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L636] assume !main_#t~short4; [L636-L641] assume !main_#t~short4; [L636] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3.base, main_#t~mem3.offset; [L642] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L642-L647] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L642] havoc main_#t~mem8.base, main_#t~mem8.offset; [L642] havoc main_#t~nondet9; [L648] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L648-L653] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15); [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14.base, main_#t~mem14.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L634-L654] assume !!(0 != main_#t~nondet1); [L634] havoc main_#t~nondet1; [L635] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L636] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L636] assume !main_#t~short4; [L636-L641] assume !main_#t~short4; [L636] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3.base, main_#t~mem3.offset; [L642] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L642-L647] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L642] havoc main_#t~mem8.base, main_#t~mem8.offset; [L642] havoc main_#t~nondet9; [L648] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L648-L653] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15); [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14.base, main_#t~mem14.offset; [L634-L654] COND FALSE !(!(0 != main_#t~nondet1)) [L634] havoc main_#t~nondet1; [L635] main_~n~0 := main_~root~0; [L636] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(main_#t~short4) [L636-L641] COND TRUE !main_#t~short4 [L636] havoc main_#t~mem2; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3; [L642] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L642] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L642] havoc main_#t~mem8; [L642] havoc main_#t~nondet9; [L648] FCALL call main_#t~mem14 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L648] COND FALSE !(main_#t~mem14 == { base: 0, offset: 0 } && 0 != main_#t~nondet15) [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L634-L654] COND FALSE !(!(0 != main_#t~nondet1)) [L634] havoc main_#t~nondet1; [L635] main_~n~0 := main_~root~0; [L636] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(main_#t~short4) [L636-L641] COND TRUE !main_#t~short4 [L636] havoc main_#t~mem2; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3; [L642] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L642] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L642] havoc main_#t~mem8; [L642] havoc main_#t~nondet9; [L648] FCALL call main_#t~mem14 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L648] COND FALSE !(main_#t~mem14 == { base: 0, offset: 0 } && 0 != main_#t~nondet15) [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14; [L634-L654] COND FALSE !(!(0 != #t~nondet1)) [L634] havoc #t~nondet1; [L635] ~n~0 := ~root~0; [L636] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(#t~short4) [L636-L641] COND TRUE !#t~short4 [L636] havoc #t~mem2; [L636] havoc #t~short4; [L636] havoc #t~mem3; [L642] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L642] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L642] havoc #t~mem8; [L642] havoc #t~nondet9; [L648] FCALL call #t~mem14 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L648] COND FALSE !(#t~mem14 == { base: 0, offset: 0 } && 0 != #t~nondet15) [L648] havoc #t~nondet15; [L648] havoc #t~mem14; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L634-L654] COND FALSE !(!(0 != #t~nondet1)) [L634] havoc #t~nondet1; [L635] ~n~0 := ~root~0; [L636] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(#t~short4) [L636-L641] COND TRUE !#t~short4 [L636] havoc #t~mem2; [L636] havoc #t~short4; [L636] havoc #t~mem3; [L642] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L642] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L642] havoc #t~mem8; [L642] havoc #t~nondet9; [L648] FCALL call #t~mem14 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L648] COND FALSE !(#t~mem14 == { base: 0, offset: 0 } && 0 != #t~nondet15) [L648] havoc #t~nondet15; [L648] havoc #t~mem14; [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR n->left [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR n->right [L648] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-23 03:20:12,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:20:12 BoogieIcfgContainer [2018-11-23 03:20:12,249 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:20:12,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:20:12,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:20:12,249 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:20:12,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:20:11" (3/4) ... [2018-11-23 03:20:12,251 INFO L141 WitnessPrinter]: Generating witness for non-termination 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~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L630] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L630] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L630] havoc main_~n~0.base, main_~n~0.offset; [L631] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L632] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [L633] call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); ----- ----- 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~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L630] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L630] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L630] havoc main_~n~0.base, main_~n~0.offset; [L631] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L632] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [L633] call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~malloc16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~nondet1, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L630] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L630] main_~root~0 := main_#t~malloc0; [L630] havoc main_~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 8 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~malloc16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~nondet1, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L630] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L630] main_~root~0 := main_#t~malloc0; [L630] havoc main_~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 8 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L630] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L630] ~root~0 := #t~malloc0; [L630] havoc ~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 8 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L630] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L630] ~root~0 := #t~malloc0; [L630] havoc ~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 8 + ~root~0!offset }, 4); [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] root->left = ((void *)0) [L632] root->right = ((void *)0) [L633] root->parent = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~nondet15;havoc main_#t~mem14.base, main_#t~mem14.offset; [L634-L654] assume !!(0 != main_#t~nondet1); [L634] havoc main_#t~nondet1; [L635] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L636] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L636] assume !main_#t~short4; [L636-L641] assume !main_#t~short4; [L636] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3.base, main_#t~mem3.offset; [L642] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L642-L647] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L642] havoc main_#t~mem8.base, main_#t~mem8.offset; [L642] havoc main_#t~nondet9; [L648] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L648-L653] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15); [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14.base, main_#t~mem14.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L634-L654] assume !!(0 != main_#t~nondet1); [L634] havoc main_#t~nondet1; [L635] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L636] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L636] assume !main_#t~short4; [L636-L641] assume !main_#t~short4; [L636] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3.base, main_#t~mem3.offset; [L642] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L642-L647] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L642] havoc main_#t~mem8.base, main_#t~mem8.offset; [L642] havoc main_#t~nondet9; [L648] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L648-L653] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15); [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14.base, main_#t~mem14.offset; [L634-L654] COND FALSE !(!(0 != main_#t~nondet1)) [L634] havoc main_#t~nondet1; [L635] main_~n~0 := main_~root~0; [L636] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(main_#t~short4) [L636-L641] COND TRUE !main_#t~short4 [L636] havoc main_#t~mem2; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3; [L642] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L642] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L642] havoc main_#t~mem8; [L642] havoc main_#t~nondet9; [L648] FCALL call main_#t~mem14 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L648] COND FALSE !(main_#t~mem14 == { base: 0, offset: 0 } && 0 != main_#t~nondet15) [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L634-L654] COND FALSE !(!(0 != main_#t~nondet1)) [L634] havoc main_#t~nondet1; [L635] main_~n~0 := main_~root~0; [L636] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(main_#t~short4) [L636-L641] COND TRUE !main_#t~short4 [L636] havoc main_#t~mem2; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3; [L642] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L642] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L642] havoc main_#t~mem8; [L642] havoc main_#t~nondet9; [L648] FCALL call main_#t~mem14 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L648] COND FALSE !(main_#t~mem14 == { base: 0, offset: 0 } && 0 != main_#t~nondet15) [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14; [L634-L654] COND FALSE !(!(0 != #t~nondet1)) [L634] havoc #t~nondet1; [L635] ~n~0 := ~root~0; [L636] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(#t~short4) [L636-L641] COND TRUE !#t~short4 [L636] havoc #t~mem2; [L636] havoc #t~short4; [L636] havoc #t~mem3; [L642] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L642] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L642] havoc #t~mem8; [L642] havoc #t~nondet9; [L648] FCALL call #t~mem14 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L648] COND FALSE !(#t~mem14 == { base: 0, offset: 0 } && 0 != #t~nondet15) [L648] havoc #t~nondet15; [L648] havoc #t~mem14; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L634-L654] COND FALSE !(!(0 != #t~nondet1)) [L634] havoc #t~nondet1; [L635] ~n~0 := ~root~0; [L636] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(#t~short4) [L636-L641] COND TRUE !#t~short4 [L636] havoc #t~mem2; [L636] havoc #t~short4; [L636] havoc #t~mem3; [L642] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L642] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L642] havoc #t~mem8; [L642] havoc #t~nondet9; [L648] FCALL call #t~mem14 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L648] COND FALSE !(#t~mem14 == { base: 0, offset: 0 } && 0 != #t~nondet15) [L648] havoc #t~nondet15; [L648] havoc #t~mem14; [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR n->left [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR n->right [L648] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-23 03:20:12,285 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6620483b-ec75-4c73-a810-9459531a7622/bin-2019/uautomizer/witness.graphml [2018-11-23 03:20:12,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:20:12,286 INFO L168 Benchmark]: Toolchain (without parser) took 1914.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 957.6 MB in the beginning and 911.6 MB in the end (delta: 46.1 MB). Peak memory consumption was 173.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:20:12,286 INFO L168 Benchmark]: CDTParser took 0.16 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 03:20:12,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:20:12,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.83 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 03:20:12,288 INFO L168 Benchmark]: Boogie Preprocessor took 20.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:20:12,288 INFO L168 Benchmark]: RCFGBuilder took 296.41 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:20:12,288 INFO L168 Benchmark]: BuchiAutomizer took 1186.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.3 MB in the end (delta: 170.3 MB). Peak memory consumption was 170.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:20:12,289 INFO L168 Benchmark]: Witness Printer took 36.23 ms. Allocated memory is still 1.2 GB. Free memory was 914.3 MB in the beginning and 911.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:20:12,291 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 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 339.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.83 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. * Boogie Preprocessor took 20.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 296.41 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1186.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.3 MB in the end (delta: 170.3 MB). Peak memory consumption was 170.3 MB. Max. memory is 11.5 GB. * Witness Printer took 36.23 ms. Allocated memory is still 1.2 GB. Free memory was 914.3 MB in the beginning and 911.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 634]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@57009713=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6923bb44=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56c3212c=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1255e2ad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3fc4f426=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@19ee2082=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e8d170e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@516c3e12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@57419b7c=0, root=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ed80979=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@57009713=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33f4001c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4578660d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e8d170e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ed80979=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@57419b7c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1255e2ad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@acf2336=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@174640af=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ab65bb5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1787debb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7dbe39f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43949753=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43949753=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3bd60aa3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@19ee2082=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@531d2c65=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6dde18b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67d32c7c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@acf2336=0, n=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6dde18b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27046f78=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3fc4f426=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@174640af=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24f639df=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@321ddfec=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@516c3e12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1787debb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3bd60aa3=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@531d2c65=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@400746f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24f639df=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d481c28=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59be58de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60eff8f1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60eff8f1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56c3212c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4578660d=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7dbe39f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59be58de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d481c28=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ab65bb5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6923bb44=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 634]: Nonterminating execution ----- 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~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L630] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L630] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L630] havoc main_~n~0.base, main_~n~0.offset; [L631] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L632] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [L633] call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); ----- ----- 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~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L630] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L630] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L630] havoc main_~n~0.base, main_~n~0.offset; [L631] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L632] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [L633] call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~malloc16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~nondet1, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L630] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L630] main_~root~0 := main_#t~malloc0; [L630] havoc main_~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 8 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~malloc16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~nondet1, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L630] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L630] main_~root~0 := main_#t~malloc0; [L630] havoc main_~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 8 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L630] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L630] ~root~0 := #t~malloc0; [L630] havoc ~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 8 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L630] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L630] ~root~0 := #t~malloc0; [L630] havoc ~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 8 + ~root~0!offset }, 4); [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] root->left = ((void *)0) [L632] root->right = ((void *)0) [L633] root->parent = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~nondet15;havoc main_#t~mem14.base, main_#t~mem14.offset; [L634-L654] assume !!(0 != main_#t~nondet1); [L634] havoc main_#t~nondet1; [L635] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L636] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L636] assume !main_#t~short4; [L636-L641] assume !main_#t~short4; [L636] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3.base, main_#t~mem3.offset; [L642] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L642-L647] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L642] havoc main_#t~mem8.base, main_#t~mem8.offset; [L642] havoc main_#t~nondet9; [L648] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L648-L653] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15); [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14.base, main_#t~mem14.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L634-L654] assume !!(0 != main_#t~nondet1); [L634] havoc main_#t~nondet1; [L635] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L636] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L636] assume !main_#t~short4; [L636-L641] assume !main_#t~short4; [L636] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3.base, main_#t~mem3.offset; [L642] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L642-L647] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L642] havoc main_#t~mem8.base, main_#t~mem8.offset; [L642] havoc main_#t~nondet9; [L648] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L648-L653] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15); [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14.base, main_#t~mem14.offset; [L634-L654] COND FALSE !(!(0 != main_#t~nondet1)) [L634] havoc main_#t~nondet1; [L635] main_~n~0 := main_~root~0; [L636] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(main_#t~short4) [L636-L641] COND TRUE !main_#t~short4 [L636] havoc main_#t~mem2; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3; [L642] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L642] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L642] havoc main_#t~mem8; [L642] havoc main_#t~nondet9; [L648] FCALL call main_#t~mem14 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L648] COND FALSE !(main_#t~mem14 == { base: 0, offset: 0 } && 0 != main_#t~nondet15) [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L634-L654] COND FALSE !(!(0 != main_#t~nondet1)) [L634] havoc main_#t~nondet1; [L635] main_~n~0 := main_~root~0; [L636] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(main_#t~short4) [L636-L641] COND TRUE !main_#t~short4 [L636] havoc main_#t~mem2; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3; [L642] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L642] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L642] havoc main_#t~mem8; [L642] havoc main_#t~nondet9; [L648] FCALL call main_#t~mem14 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L648] COND FALSE !(main_#t~mem14 == { base: 0, offset: 0 } && 0 != main_#t~nondet15) [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14; [L634-L654] COND FALSE !(!(0 != #t~nondet1)) [L634] havoc #t~nondet1; [L635] ~n~0 := ~root~0; [L636] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(#t~short4) [L636-L641] COND TRUE !#t~short4 [L636] havoc #t~mem2; [L636] havoc #t~short4; [L636] havoc #t~mem3; [L642] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L642] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L642] havoc #t~mem8; [L642] havoc #t~nondet9; [L648] FCALL call #t~mem14 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L648] COND FALSE !(#t~mem14 == { base: 0, offset: 0 } && 0 != #t~nondet15) [L648] havoc #t~nondet15; [L648] havoc #t~mem14; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L634-L654] COND FALSE !(!(0 != #t~nondet1)) [L634] havoc #t~nondet1; [L635] ~n~0 := ~root~0; [L636] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(#t~short4) [L636-L641] COND TRUE !#t~short4 [L636] havoc #t~mem2; [L636] havoc #t~short4; [L636] havoc #t~mem3; [L642] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L642] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L642] havoc #t~mem8; [L642] havoc #t~nondet9; [L648] FCALL call #t~mem14 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L648] COND FALSE !(#t~mem14 == { base: 0, offset: 0 } && 0 != #t~nondet15) [L648] havoc #t~nondet15; [L648] havoc #t~mem14; [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR n->left [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR n->right [L648] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- ----- 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~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L630] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L630] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L630] havoc main_~n~0.base, main_~n~0.offset; [L631] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L632] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [L633] call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); ----- ----- 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~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L630] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L630] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L630] havoc main_~n~0.base, main_~n~0.offset; [L631] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L632] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [L633] call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~malloc16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~nondet1, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L630] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L630] main_~root~0 := main_#t~malloc0; [L630] havoc main_~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 8 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~malloc16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~nondet1, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L630] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L630] main_~root~0 := main_#t~malloc0; [L630] havoc main_~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 8 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L630] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L630] ~root~0 := #t~malloc0; [L630] havoc ~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 8 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L630] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L630] ~root~0 := #t~malloc0; [L630] havoc ~n~0; [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L632] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L633] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 8 + ~root~0!offset }, 4); [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] root->left = ((void *)0) [L632] root->right = ((void *)0) [L633] root->parent = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~nondet15;havoc main_#t~mem14.base, main_#t~mem14.offset; [L634-L654] assume !!(0 != main_#t~nondet1); [L634] havoc main_#t~nondet1; [L635] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L636] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L636] assume !main_#t~short4; [L636-L641] assume !main_#t~short4; [L636] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3.base, main_#t~mem3.offset; [L642] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L642-L647] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L642] havoc main_#t~mem8.base, main_#t~mem8.offset; [L642] havoc main_#t~nondet9; [L648] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L648-L653] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15); [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14.base, main_#t~mem14.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L634-L654] assume !!(0 != main_#t~nondet1); [L634] havoc main_#t~nondet1; [L635] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L636] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L636] assume !main_#t~short4; [L636-L641] assume !main_#t~short4; [L636] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3.base, main_#t~mem3.offset; [L642] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L642-L647] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L642] havoc main_#t~mem8.base, main_#t~mem8.offset; [L642] havoc main_#t~nondet9; [L648] call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L648-L653] assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15); [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14.base, main_#t~mem14.offset; [L634-L654] COND FALSE !(!(0 != main_#t~nondet1)) [L634] havoc main_#t~nondet1; [L635] main_~n~0 := main_~root~0; [L636] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(main_#t~short4) [L636-L641] COND TRUE !main_#t~short4 [L636] havoc main_#t~mem2; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3; [L642] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L642] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L642] havoc main_#t~mem8; [L642] havoc main_#t~nondet9; [L648] FCALL call main_#t~mem14 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L648] COND FALSE !(main_#t~mem14 == { base: 0, offset: 0 } && 0 != main_#t~nondet15) [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L634-L654] COND FALSE !(!(0 != main_#t~nondet1)) [L634] havoc main_#t~nondet1; [L635] main_~n~0 := main_~root~0; [L636] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(main_#t~short4) [L636-L641] COND TRUE !main_#t~short4 [L636] havoc main_#t~mem2; [L636] havoc main_#t~short4; [L636] havoc main_#t~mem3; [L642] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L642] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L642] havoc main_#t~mem8; [L642] havoc main_#t~nondet9; [L648] FCALL call main_#t~mem14 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L648] COND FALSE !(main_#t~mem14 == { base: 0, offset: 0 } && 0 != main_#t~nondet15) [L648] havoc main_#t~nondet15; [L648] havoc main_#t~mem14; [L634-L654] COND FALSE !(!(0 != #t~nondet1)) [L634] havoc #t~nondet1; [L635] ~n~0 := ~root~0; [L636] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(#t~short4) [L636-L641] COND TRUE !#t~short4 [L636] havoc #t~mem2; [L636] havoc #t~short4; [L636] havoc #t~mem3; [L642] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L642] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L642] havoc #t~mem8; [L642] havoc #t~nondet9; [L648] FCALL call #t~mem14 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L648] COND FALSE !(#t~mem14 == { base: 0, offset: 0 } && 0 != #t~nondet15) [L648] havoc #t~nondet15; [L648] havoc #t~mem14; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L634-L654] COND FALSE !(!(0 != #t~nondet1)) [L634] havoc #t~nondet1; [L635] ~n~0 := ~root~0; [L636] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L636] COND FALSE !(#t~short4) [L636-L641] COND TRUE !#t~short4 [L636] havoc #t~mem2; [L636] havoc #t~short4; [L636] havoc #t~mem3; [L642] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L642] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L642] havoc #t~mem8; [L642] havoc #t~nondet9; [L648] FCALL call #t~mem14 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L648] COND FALSE !(#t~mem14 == { base: 0, offset: 0 } && 0 != #t~nondet15) [L648] havoc #t~nondet15; [L648] havoc #t~mem14; [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR n->left [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR n->right [L648] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] root->left = ((void *)0) [L632] root->right = ((void *)0) [L633] root->parent = ((void *)0) Loop: [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR n->left [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR n->right [L648] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...