./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_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_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/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 ce077c63676f801e14160b963d91b2f98c313404 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-22 23:51:04,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:51:04,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:51:04,407 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:51:04,407 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:51:04,408 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:51:04,409 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:51:04,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:51:04,412 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:51:04,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:51:04,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:51:04,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:51:04,414 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:51:04,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:51:04,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:51:04,417 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:51:04,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:51:04,419 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:51:04,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:51:04,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:51:04,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:51:04,423 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:51:04,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:51:04,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:51:04,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:51:04,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:51:04,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:51:04,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:51:04,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:51:04,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:51:04,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:51:04,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:51:04,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:51:04,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:51:04,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:51:04,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:51:04,431 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 23:51:04,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:51:04,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:51:04,443 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:51:04,444 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:51:04,444 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:51:04,444 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:51:04,444 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:51:04,444 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:51:04,444 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:51:04,445 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:51:04,445 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:51:04,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:51:04,445 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:51:04,445 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:51:04,445 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:51:04,445 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:51:04,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:51:04,446 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:51:04,446 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:51:04,446 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:51:04,446 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:51:04,446 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:51:04,446 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:51:04,447 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:51:04,447 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:51:04,447 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:51:04,447 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:51:04,447 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:51:04,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:51:04,448 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:51:04,448 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:51:04,450 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:51:04,450 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_5609eca2-3beb-43e8-987d-b230e0adc1a7/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 -> ce077c63676f801e14160b963d91b2f98c313404 [2018-11-22 23:51:04,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:51:04,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:51:04,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:51:04,490 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:51:04,490 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:51:04,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-22 23:51:04,542 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/data/0d97937ed/a8dc77d44f154f87a2550fef807003d4/FLAGbbaeafc08 [2018-11-22 23:51:04,947 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:51:04,947 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-22 23:51:04,954 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/data/0d97937ed/a8dc77d44f154f87a2550fef807003d4/FLAGbbaeafc08 [2018-11-22 23:51:04,963 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/data/0d97937ed/a8dc77d44f154f87a2550fef807003d4 [2018-11-22 23:51:04,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:51:04,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:51:04,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:51:04,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:51:04,970 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:51:04,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:51:04" (1/1) ... [2018-11-22 23:51:04,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335f4bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:04, skipping insertion in model container [2018-11-22 23:51:04,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:51:04" (1/1) ... [2018-11-22 23:51:04,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:51:05,008 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:51:05,222 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:51:05,231 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:51:05,316 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:51:05,351 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:51:05,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05 WrapperNode [2018-11-22 23:51:05,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:51:05,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:51:05,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:51:05,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:51:05,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... [2018-11-22 23:51:05,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... [2018-11-22 23:51:05,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:51:05,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:51:05,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:51:05,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:51:05,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... [2018-11-22 23:51:05,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... [2018-11-22 23:51:05,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... [2018-11-22 23:51:05,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... [2018-11-22 23:51:05,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... [2018-11-22 23:51:05,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... [2018-11-22 23:51:05,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... [2018-11-22 23:51:05,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:51:05,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:51:05,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:51:05,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:51:05,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/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-22 23:51:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:51:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:51:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:51:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 23:51:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 23:51:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:51:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:51:05,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:51:05,777 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:51:05,778 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-22 23:51:05,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:51:05 BoogieIcfgContainer [2018-11-22 23:51:05,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:51:05,779 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:51:05,779 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:51:05,781 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:51:05,782 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:51:05,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:51:04" (1/3) ... [2018-11-22 23:51:05,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7691a126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:51:05, skipping insertion in model container [2018-11-22 23:51:05,782 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:51:05,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:51:05" (2/3) ... [2018-11-22 23:51:05,783 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7691a126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:51:05, skipping insertion in model container [2018-11-22 23:51:05,783 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:51:05,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:51:05" (3/3) ... [2018-11-22 23:51:05,784 INFO L375 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-22 23:51:05,818 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:51:05,818 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:51:05,818 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:51:05,819 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:51:05,819 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:51:05,819 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:51:05,819 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:51:05,819 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:51:05,819 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:51:05,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-11-22 23:51:05,850 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2018-11-22 23:51:05,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:51:05,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:51:05,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:51:05,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:51:05,857 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:51:05,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-11-22 23:51:05,860 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2018-11-22 23:51:05,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:51:05,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:51:05,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:51:05,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:51:05,868 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); 8#L557-2true [2018-11-22 23:51:05,868 INFO L796 eck$LassoCheckResult]: Loop: 8#L557-2true assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 30#L547-2true assume !true; 40#L546-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 17#L552true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 23#L552-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 4#L557true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 8#L557-2true [2018-11-22 23:51:05,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:05,874 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 23:51:05,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:05,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:05,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:05,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:51:05,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:05,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2018-11-22 23:51:05,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:05,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:05,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:51:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:51:05,999 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-22 23:51:06,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:51:06,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:51:06,004 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:51:06,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 23:51:06,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 23:51:06,022 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-22 23:51:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:51:06,028 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2018-11-22 23:51:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 23:51:06,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2018-11-22 23:51:06,032 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2018-11-22 23:51:06,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 55 transitions. [2018-11-22 23:51:06,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-22 23:51:06,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-22 23:51:06,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2018-11-22 23:51:06,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:51:06,039 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2018-11-22 23:51:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2018-11-22 23:51:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-22 23:51:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-22 23:51:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2018-11-22 23:51:06,062 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2018-11-22 23:51:06,063 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2018-11-22 23:51:06,063 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:51:06,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2018-11-22 23:51:06,064 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2018-11-22 23:51:06,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:51:06,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:51:06,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:51:06,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:51:06,065 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 114#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); 99#L557-2 [2018-11-22 23:51:06,065 INFO L796 eck$LassoCheckResult]: Loop: 99#L557-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 104#L547-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 101#L546-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 102#L546-3 assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; 112#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 119#L552 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 120#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 98#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 99#L557-2 [2018-11-22 23:51:06,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-22 23:51:06,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:06,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:06,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:51:06,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2018-11-22 23:51:06,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:06,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:06,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:51:06,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:51:06,173 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-22 23:51:06,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:51:06,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:51:06,174 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:51:06,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:51:06,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:51:06,175 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand 5 states. [2018-11-22 23:51:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:51:06,323 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2018-11-22 23:51:06,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:51:06,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2018-11-22 23:51:06,324 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2018-11-22 23:51:06,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2018-11-22 23:51:06,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-22 23:51:06,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-22 23:51:06,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2018-11-22 23:51:06,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:51:06,327 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2018-11-22 23:51:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2018-11-22 23:51:06,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-22 23:51:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 23:51:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-11-22 23:51:06,331 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-11-22 23:51:06,331 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-11-22 23:51:06,331 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 23:51:06,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2018-11-22 23:51:06,332 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2018-11-22 23:51:06,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:51:06,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:51:06,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:51:06,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:51:06,333 INFO L794 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 206#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); 190#L557-2 [2018-11-22 23:51:06,333 INFO L796 eck$LassoCheckResult]: Loop: 190#L557-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 196#L547-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 192#L546-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 193#L546-3 assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; 226#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 211#L552 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 212#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 189#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 190#L557-2 [2018-11-22 23:51:06,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:06,334 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-22 23:51:06,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:06,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:06,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:51:06,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:06,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2018-11-22 23:51:06,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:06,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:06,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:51:06,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2018-11-22 23:51:06,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:06,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:06,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:51:06,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:51:06,453 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-22 23:51:06,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:51:06,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:51:06,590 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-22 23:51:06,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:51:06,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:51:06,655 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand 5 states. [2018-11-22 23:51:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:51:06,874 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-11-22 23:51:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:51:06,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2018-11-22 23:51:06,876 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2018-11-22 23:51:06,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2018-11-22 23:51:06,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2018-11-22 23:51:06,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-22 23:51:06,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2018-11-22 23:51:06,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:51:06,879 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2018-11-22 23:51:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2018-11-22 23:51:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2018-11-22 23:51:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-22 23:51:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2018-11-22 23:51:06,882 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2018-11-22 23:51:06,882 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2018-11-22 23:51:06,882 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 23:51:06,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2018-11-22 23:51:06,883 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2018-11-22 23:51:06,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:51:06,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:51:06,884 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:51:06,884 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:51:06,884 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); 351#L557-2 [2018-11-22 23:51:06,884 INFO L796 eck$LassoCheckResult]: Loop: 351#L557-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 366#L547-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 338#L546-1 assume !main_#t~short6; 339#L546-3 assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; 349#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 379#L552 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 359#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 360#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 351#L557-2 [2018-11-22 23:51:06,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-22 23:51:06,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:06,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:51:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2018-11-22 23:51:06,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:06,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:06,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:51:06,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:51:06,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2018-11-22 23:51:06,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:51:06,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:51:06,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:51:06,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:51:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:51:07,055 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-11-22 23:51:07,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:51:07,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:51:07,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:51:07,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:116, output treesize:104 ----- 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~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset; [L541] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L541] main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L541] havoc main_~n~0.base, main_~n~0.offset; [L542] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, main_~root~0.base, 4 + 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~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset; [L541] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L541] main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L541] havoc main_~n~0.base, main_~n~0.offset; [L542] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem10, main_#t~nondet11, main_#t~malloc12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~malloc17, main_#t~mem18, main_#t~mem19, main_#t~nondet3, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem20, main_#t~mem21, main_#t~short22, main_#t~mem26, main_#t~malloc27, main_#t~malloc29, main_#t~mem30, main_#t~nondet28, main_#t~malloc32, main_#t~mem33, main_#t~nondet31, main_#t~mem35, main_#t~mem34, main_#t~mem37, main_#t~mem36, main_#t~mem38, main_~root~0, main_~n~0, main_~pred~0, main_~a~0, main_~t~0, main_~p~0; [L541] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L541] main_~root~0 := main_#t~malloc2; [L541] havoc main_~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + 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~malloc2, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem10, main_#t~nondet11, main_#t~malloc12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~malloc17, main_#t~mem18, main_#t~mem19, main_#t~nondet3, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem20, main_#t~mem21, main_#t~short22, main_#t~mem26, main_#t~malloc27, main_#t~malloc29, main_#t~mem30, main_#t~nondet28, main_#t~malloc32, main_#t~mem33, main_#t~nondet31, main_#t~mem35, main_#t~mem34, main_#t~mem37, main_#t~mem36, main_#t~mem38, main_~root~0, main_~n~0, main_~pred~0, main_~a~0, main_~t~0, main_~p~0; [L541] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L541] main_~root~0 := main_#t~malloc2; [L541] havoc main_~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [?] assume !main_#t~short6; [?] assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; [?] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; [?] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; [L544-L562] assume !!(0 != main_#t~nondet3); [L544] havoc main_#t~nondet3; [L545] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L546] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L546] main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [L546] assume !main_#t~short6; [L546-L551] assume !main_#t~short6; [L546] havoc main_#t~mem4.base, main_#t~mem4.offset; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5.base, main_#t~mem5.offset; [L552] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L552-L556] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11); [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10.base, main_#t~mem10.offset; [L557] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L557-L561] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16); [L557] havoc main_#t~mem15.base, main_#t~mem15.offset; [L557] havoc main_#t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L544-L562] assume !!(0 != main_#t~nondet3); [L544] havoc main_#t~nondet3; [L545] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L546] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L546] main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [L546] assume !main_#t~short6; [L546-L551] assume !main_#t~short6; [L546] havoc main_#t~mem4.base, main_#t~mem4.offset; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5.base, main_#t~mem5.offset; [L552] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L552-L556] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11); [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10.base, main_#t~mem10.offset; [L557] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L557-L561] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16); [L557] havoc main_#t~mem15.base, main_#t~mem15.offset; [L557] havoc main_#t~nondet16; [L544-L562] COND FALSE !(!(0 != main_#t~nondet3)) [L544] havoc main_#t~nondet3; [L545] main_~n~0 := main_~root~0; [L546] FCALL call main_#t~mem4 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L546] main_#t~short6 := main_#t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(main_#t~short6) [L546-L551] COND TRUE !main_#t~short6 [L546] havoc main_#t~mem4; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5; [L552] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L552] COND FALSE !(main_#t~mem10 == { base: 0, offset: 0 } && 0 != main_#t~nondet11) [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10; [L557] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L557] COND FALSE !(main_#t~mem15 == { base: 0, offset: 0 } && 0 != main_#t~nondet16) [L557] havoc main_#t~mem15; [L557] havoc main_#t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L544-L562] COND FALSE !(!(0 != main_#t~nondet3)) [L544] havoc main_#t~nondet3; [L545] main_~n~0 := main_~root~0; [L546] FCALL call main_#t~mem4 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L546] main_#t~short6 := main_#t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(main_#t~short6) [L546-L551] COND TRUE !main_#t~short6 [L546] havoc main_#t~mem4; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5; [L552] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L552] COND FALSE !(main_#t~mem10 == { base: 0, offset: 0 } && 0 != main_#t~nondet11) [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10; [L557] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L557] COND FALSE !(main_#t~mem15 == { base: 0, offset: 0 } && 0 != main_#t~nondet16) [L557] havoc main_#t~mem15; [L557] havoc main_#t~nondet16; [L544-L562] COND FALSE !(!(0 != #t~nondet3)) [L544] havoc #t~nondet3; [L545] ~n~0 := ~root~0; [L546] FCALL call #t~mem4 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L546] #t~short6 := #t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(#t~short6) [L546-L551] COND TRUE !#t~short6 [L546] havoc #t~mem4; [L546] havoc #t~short6; [L546] havoc #t~mem5; [L552] FCALL call #t~mem10 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L552] COND FALSE !(#t~mem10 == { base: 0, offset: 0 } && 0 != #t~nondet11) [L552] havoc #t~nondet11; [L552] havoc #t~mem10; [L557] FCALL call #t~mem15 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L557] COND FALSE !(#t~mem15 == { base: 0, offset: 0 } && 0 != #t~nondet16) [L557] havoc #t~mem15; [L557] havoc #t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L544-L562] COND FALSE !(!(0 != #t~nondet3)) [L544] havoc #t~nondet3; [L545] ~n~0 := ~root~0; [L546] FCALL call #t~mem4 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L546] #t~short6 := #t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(#t~short6) [L546-L551] COND TRUE !#t~short6 [L546] havoc #t~mem4; [L546] havoc #t~short6; [L546] havoc #t~mem5; [L552] FCALL call #t~mem10 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L552] COND FALSE !(#t~mem10 == { base: 0, offset: 0 } && 0 != #t~nondet11) [L552] havoc #t~nondet11; [L552] havoc #t~mem10; [L557] FCALL call #t~mem15 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L557] COND FALSE !(#t~mem15 == { base: 0, offset: 0 } && 0 != #t~nondet16) [L557] havoc #t~mem15; [L557] havoc #t~nondet16; [L544] COND TRUE __VERIFIER_nondet_int() [L545] n = root [L546] EXPR n->left [L546] n->left && n->right [L546] COND FALSE !(n->left && n->right) [L552] EXPR n->left [L552] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L557] EXPR n->right [L557] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-22 23:51:07,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 11:51:07 BoogieIcfgContainer [2018-11-22 23:51:07,309 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 23:51:07,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:51:07,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:51:07,309 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:51:07,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:51:05" (3/4) ... [2018-11-22 23:51:07,312 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~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset; [L541] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L541] main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L541] havoc main_~n~0.base, main_~n~0.offset; [L542] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, main_~root~0.base, 4 + 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~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset; [L541] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L541] main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L541] havoc main_~n~0.base, main_~n~0.offset; [L542] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem10, main_#t~nondet11, main_#t~malloc12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~malloc17, main_#t~mem18, main_#t~mem19, main_#t~nondet3, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem20, main_#t~mem21, main_#t~short22, main_#t~mem26, main_#t~malloc27, main_#t~malloc29, main_#t~mem30, main_#t~nondet28, main_#t~malloc32, main_#t~mem33, main_#t~nondet31, main_#t~mem35, main_#t~mem34, main_#t~mem37, main_#t~mem36, main_#t~mem38, main_~root~0, main_~n~0, main_~pred~0, main_~a~0, main_~t~0, main_~p~0; [L541] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L541] main_~root~0 := main_#t~malloc2; [L541] havoc main_~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + 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~malloc2, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem10, main_#t~nondet11, main_#t~malloc12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~malloc17, main_#t~mem18, main_#t~mem19, main_#t~nondet3, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem20, main_#t~mem21, main_#t~short22, main_#t~mem26, main_#t~malloc27, main_#t~malloc29, main_#t~mem30, main_#t~nondet28, main_#t~malloc32, main_#t~mem33, main_#t~nondet31, main_#t~mem35, main_#t~mem34, main_#t~mem37, main_#t~mem36, main_#t~mem38, main_~root~0, main_~n~0, main_~pred~0, main_~a~0, main_~t~0, main_~p~0; [L541] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L541] main_~root~0 := main_#t~malloc2; [L541] havoc main_~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [?] assume !main_#t~short6; [?] assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; [?] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; [?] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; [L544-L562] assume !!(0 != main_#t~nondet3); [L544] havoc main_#t~nondet3; [L545] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L546] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L546] main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [L546] assume !main_#t~short6; [L546-L551] assume !main_#t~short6; [L546] havoc main_#t~mem4.base, main_#t~mem4.offset; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5.base, main_#t~mem5.offset; [L552] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L552-L556] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11); [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10.base, main_#t~mem10.offset; [L557] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L557-L561] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16); [L557] havoc main_#t~mem15.base, main_#t~mem15.offset; [L557] havoc main_#t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L544-L562] assume !!(0 != main_#t~nondet3); [L544] havoc main_#t~nondet3; [L545] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L546] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L546] main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [L546] assume !main_#t~short6; [L546-L551] assume !main_#t~short6; [L546] havoc main_#t~mem4.base, main_#t~mem4.offset; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5.base, main_#t~mem5.offset; [L552] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L552-L556] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11); [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10.base, main_#t~mem10.offset; [L557] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L557-L561] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16); [L557] havoc main_#t~mem15.base, main_#t~mem15.offset; [L557] havoc main_#t~nondet16; [L544-L562] COND FALSE !(!(0 != main_#t~nondet3)) [L544] havoc main_#t~nondet3; [L545] main_~n~0 := main_~root~0; [L546] FCALL call main_#t~mem4 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L546] main_#t~short6 := main_#t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(main_#t~short6) [L546-L551] COND TRUE !main_#t~short6 [L546] havoc main_#t~mem4; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5; [L552] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L552] COND FALSE !(main_#t~mem10 == { base: 0, offset: 0 } && 0 != main_#t~nondet11) [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10; [L557] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L557] COND FALSE !(main_#t~mem15 == { base: 0, offset: 0 } && 0 != main_#t~nondet16) [L557] havoc main_#t~mem15; [L557] havoc main_#t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L544-L562] COND FALSE !(!(0 != main_#t~nondet3)) [L544] havoc main_#t~nondet3; [L545] main_~n~0 := main_~root~0; [L546] FCALL call main_#t~mem4 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L546] main_#t~short6 := main_#t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(main_#t~short6) [L546-L551] COND TRUE !main_#t~short6 [L546] havoc main_#t~mem4; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5; [L552] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L552] COND FALSE !(main_#t~mem10 == { base: 0, offset: 0 } && 0 != main_#t~nondet11) [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10; [L557] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L557] COND FALSE !(main_#t~mem15 == { base: 0, offset: 0 } && 0 != main_#t~nondet16) [L557] havoc main_#t~mem15; [L557] havoc main_#t~nondet16; [L544-L562] COND FALSE !(!(0 != #t~nondet3)) [L544] havoc #t~nondet3; [L545] ~n~0 := ~root~0; [L546] FCALL call #t~mem4 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L546] #t~short6 := #t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(#t~short6) [L546-L551] COND TRUE !#t~short6 [L546] havoc #t~mem4; [L546] havoc #t~short6; [L546] havoc #t~mem5; [L552] FCALL call #t~mem10 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L552] COND FALSE !(#t~mem10 == { base: 0, offset: 0 } && 0 != #t~nondet11) [L552] havoc #t~nondet11; [L552] havoc #t~mem10; [L557] FCALL call #t~mem15 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L557] COND FALSE !(#t~mem15 == { base: 0, offset: 0 } && 0 != #t~nondet16) [L557] havoc #t~mem15; [L557] havoc #t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L544-L562] COND FALSE !(!(0 != #t~nondet3)) [L544] havoc #t~nondet3; [L545] ~n~0 := ~root~0; [L546] FCALL call #t~mem4 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L546] #t~short6 := #t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(#t~short6) [L546-L551] COND TRUE !#t~short6 [L546] havoc #t~mem4; [L546] havoc #t~short6; [L546] havoc #t~mem5; [L552] FCALL call #t~mem10 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L552] COND FALSE !(#t~mem10 == { base: 0, offset: 0 } && 0 != #t~nondet11) [L552] havoc #t~nondet11; [L552] havoc #t~mem10; [L557] FCALL call #t~mem15 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L557] COND FALSE !(#t~mem15 == { base: 0, offset: 0 } && 0 != #t~nondet16) [L557] havoc #t~mem15; [L557] havoc #t~nondet16; [L544] COND TRUE __VERIFIER_nondet_int() [L545] n = root [L546] EXPR n->left [L546] n->left && n->right [L546] COND FALSE !(n->left && n->right) [L552] EXPR n->left [L552] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L557] EXPR n->right [L557] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-22 23:51:07,352 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5609eca2-3beb-43e8-987d-b230e0adc1a7/bin-2019/uautomizer/witness.graphml [2018-11-22 23:51:07,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:51:07,353 INFO L168 Benchmark]: Toolchain (without parser) took 2386.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 955.4 MB in the beginning and 899.7 MB in the end (delta: 55.7 MB). Peak memory consumption was 213.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:51:07,353 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:51:07,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:51:07,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.56 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-22 23:51:07,354 INFO L168 Benchmark]: Boogie Preprocessor took 22.10 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:51:07,355 INFO L168 Benchmark]: RCFGBuilder took 369.73 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: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:51:07,355 INFO L168 Benchmark]: BuchiAutomizer took 1530.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.7 MB in the end (delta: 199.0 MB). Peak memory consumption was 199.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:51:07,355 INFO L168 Benchmark]: Witness Printer took 43.04 ms. Allocated memory is still 1.2 GB. Free memory is still 899.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:51:07,357 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.56 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. * Boogie Preprocessor took 22.10 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 369.73 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: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1530.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.7 MB in the end (delta: 199.0 MB). Peak memory consumption was 199.0 MB. Max. memory is 11.5 GB. * Witness Printer took 43.04 ms. Allocated memory is still 1.2 GB. Free memory is still 899.7 MB. There was no memory consumed. 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 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 166 SDtfs, 71 SDslu, 179 SDs, 0 SdLazy, 191 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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: 544]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e161ce3=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@189bd6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78a9a632=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3754954c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@517d63e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6982af7b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@440cbe54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a414378=0, root=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56a3d3fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e161ce3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@601830f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ab65bb5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@498a8492=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@636fb19b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@266f0d06=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ecbb6a3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56a3d3fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ab65bb5=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@498a8492=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37071c66=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a414378=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@184c6138=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e489066=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78a9a632=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f3a7d45=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@44ea3894=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@517d63e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fb54550=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37071c66=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6982af7b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ecbb6a3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c6a8b8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6640efce=0, n=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f97945d=21, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d4d4134=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6336e087=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bd8e50f=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e489066=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@184c6138=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@798d8783=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3754954c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@440cbe54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f763643=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fb54550=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4f9903b0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@575ac218=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c6a8b8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f763643=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@798d8783=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ec834fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3a9dcc19=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@6dde18b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48c8e84b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bd8e50f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@620df64f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@189bd6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f3a7d45=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@44ea3894=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ec834fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@575ac218=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@620df64f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@518bb55f=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@266f0d06=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 544]: 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~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset; [L541] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L541] main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L541] havoc main_~n~0.base, main_~n~0.offset; [L542] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, main_~root~0.base, 4 + 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~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset; [L541] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L541] main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L541] havoc main_~n~0.base, main_~n~0.offset; [L542] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem10, main_#t~nondet11, main_#t~malloc12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~malloc17, main_#t~mem18, main_#t~mem19, main_#t~nondet3, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem20, main_#t~mem21, main_#t~short22, main_#t~mem26, main_#t~malloc27, main_#t~malloc29, main_#t~mem30, main_#t~nondet28, main_#t~malloc32, main_#t~mem33, main_#t~nondet31, main_#t~mem35, main_#t~mem34, main_#t~mem37, main_#t~mem36, main_#t~mem38, main_~root~0, main_~n~0, main_~pred~0, main_~a~0, main_~t~0, main_~p~0; [L541] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L541] main_~root~0 := main_#t~malloc2; [L541] havoc main_~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + 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~malloc2, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem10, main_#t~nondet11, main_#t~malloc12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~malloc17, main_#t~mem18, main_#t~mem19, main_#t~nondet3, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem20, main_#t~mem21, main_#t~short22, main_#t~mem26, main_#t~malloc27, main_#t~malloc29, main_#t~mem30, main_#t~nondet28, main_#t~malloc32, main_#t~mem33, main_#t~nondet31, main_#t~mem35, main_#t~mem34, main_#t~mem37, main_#t~mem36, main_#t~mem38, main_~root~0, main_~n~0, main_~pred~0, main_~a~0, main_~t~0, main_~p~0; [L541] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L541] main_~root~0 := main_#t~malloc2; [L541] havoc main_~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [?] assume !main_#t~short6; [?] assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; [?] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; [?] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; [L544-L562] assume !!(0 != main_#t~nondet3); [L544] havoc main_#t~nondet3; [L545] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L546] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L546] main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [L546] assume !main_#t~short6; [L546-L551] assume !main_#t~short6; [L546] havoc main_#t~mem4.base, main_#t~mem4.offset; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5.base, main_#t~mem5.offset; [L552] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L552-L556] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11); [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10.base, main_#t~mem10.offset; [L557] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L557-L561] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16); [L557] havoc main_#t~mem15.base, main_#t~mem15.offset; [L557] havoc main_#t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L544-L562] assume !!(0 != main_#t~nondet3); [L544] havoc main_#t~nondet3; [L545] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L546] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L546] main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [L546] assume !main_#t~short6; [L546-L551] assume !main_#t~short6; [L546] havoc main_#t~mem4.base, main_#t~mem4.offset; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5.base, main_#t~mem5.offset; [L552] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L552-L556] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11); [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10.base, main_#t~mem10.offset; [L557] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L557-L561] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16); [L557] havoc main_#t~mem15.base, main_#t~mem15.offset; [L557] havoc main_#t~nondet16; [L544-L562] COND FALSE !(!(0 != main_#t~nondet3)) [L544] havoc main_#t~nondet3; [L545] main_~n~0 := main_~root~0; [L546] FCALL call main_#t~mem4 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L546] main_#t~short6 := main_#t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(main_#t~short6) [L546-L551] COND TRUE !main_#t~short6 [L546] havoc main_#t~mem4; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5; [L552] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L552] COND FALSE !(main_#t~mem10 == { base: 0, offset: 0 } && 0 != main_#t~nondet11) [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10; [L557] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L557] COND FALSE !(main_#t~mem15 == { base: 0, offset: 0 } && 0 != main_#t~nondet16) [L557] havoc main_#t~mem15; [L557] havoc main_#t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L544-L562] COND FALSE !(!(0 != main_#t~nondet3)) [L544] havoc main_#t~nondet3; [L545] main_~n~0 := main_~root~0; [L546] FCALL call main_#t~mem4 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L546] main_#t~short6 := main_#t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(main_#t~short6) [L546-L551] COND TRUE !main_#t~short6 [L546] havoc main_#t~mem4; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5; [L552] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L552] COND FALSE !(main_#t~mem10 == { base: 0, offset: 0 } && 0 != main_#t~nondet11) [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10; [L557] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L557] COND FALSE !(main_#t~mem15 == { base: 0, offset: 0 } && 0 != main_#t~nondet16) [L557] havoc main_#t~mem15; [L557] havoc main_#t~nondet16; [L544-L562] COND FALSE !(!(0 != #t~nondet3)) [L544] havoc #t~nondet3; [L545] ~n~0 := ~root~0; [L546] FCALL call #t~mem4 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L546] #t~short6 := #t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(#t~short6) [L546-L551] COND TRUE !#t~short6 [L546] havoc #t~mem4; [L546] havoc #t~short6; [L546] havoc #t~mem5; [L552] FCALL call #t~mem10 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L552] COND FALSE !(#t~mem10 == { base: 0, offset: 0 } && 0 != #t~nondet11) [L552] havoc #t~nondet11; [L552] havoc #t~mem10; [L557] FCALL call #t~mem15 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L557] COND FALSE !(#t~mem15 == { base: 0, offset: 0 } && 0 != #t~nondet16) [L557] havoc #t~mem15; [L557] havoc #t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L544-L562] COND FALSE !(!(0 != #t~nondet3)) [L544] havoc #t~nondet3; [L545] ~n~0 := ~root~0; [L546] FCALL call #t~mem4 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L546] #t~short6 := #t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(#t~short6) [L546-L551] COND TRUE !#t~short6 [L546] havoc #t~mem4; [L546] havoc #t~short6; [L546] havoc #t~mem5; [L552] FCALL call #t~mem10 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L552] COND FALSE !(#t~mem10 == { base: 0, offset: 0 } && 0 != #t~nondet11) [L552] havoc #t~nondet11; [L552] havoc #t~mem10; [L557] FCALL call #t~mem15 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L557] COND FALSE !(#t~mem15 == { base: 0, offset: 0 } && 0 != #t~nondet16) [L557] havoc #t~mem15; [L557] havoc #t~nondet16; [L544] COND TRUE __VERIFIER_nondet_int() [L545] n = root [L546] EXPR n->left [L546] n->left && n->right [L546] COND FALSE !(n->left && n->right) [L552] EXPR n->left [L552] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L557] EXPR n->right [L557] 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~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset; [L541] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L541] main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L541] havoc main_~n~0.base, main_~n~0.offset; [L542] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, main_~root~0.base, 4 + 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~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset; [L541] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L541] main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L541] havoc main_~n~0.base, main_~n~0.offset; [L542] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem10, main_#t~nondet11, main_#t~malloc12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~malloc17, main_#t~mem18, main_#t~mem19, main_#t~nondet3, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem20, main_#t~mem21, main_#t~short22, main_#t~mem26, main_#t~malloc27, main_#t~malloc29, main_#t~mem30, main_#t~nondet28, main_#t~malloc32, main_#t~mem33, main_#t~nondet31, main_#t~mem35, main_#t~mem34, main_#t~mem37, main_#t~mem36, main_#t~mem38, main_~root~0, main_~n~0, main_~pred~0, main_~a~0, main_~t~0, main_~p~0; [L541] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L541] main_~root~0 := main_#t~malloc2; [L541] havoc main_~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + 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~malloc2, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem10, main_#t~nondet11, main_#t~malloc12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~malloc17, main_#t~mem18, main_#t~mem19, main_#t~nondet3, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem20, main_#t~mem21, main_#t~short22, main_#t~mem26, main_#t~malloc27, main_#t~malloc29, main_#t~mem30, main_#t~nondet28, main_#t~malloc32, main_#t~mem33, main_#t~nondet31, main_#t~mem35, main_#t~mem34, main_#t~mem37, main_#t~mem36, main_#t~mem38, main_~root~0, main_~n~0, main_~pred~0, main_~a~0, main_~t~0, main_~p~0; [L541] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L541] main_~root~0 := main_#t~malloc2; [L541] havoc main_~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [?] assume !main_#t~short6; [?] assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; [?] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; [?] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; [L544-L562] assume !!(0 != main_#t~nondet3); [L544] havoc main_#t~nondet3; [L545] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L546] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L546] main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [L546] assume !main_#t~short6; [L546-L551] assume !main_#t~short6; [L546] havoc main_#t~mem4.base, main_#t~mem4.offset; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5.base, main_#t~mem5.offset; [L552] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L552-L556] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11); [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10.base, main_#t~mem10.offset; [L557] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L557-L561] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16); [L557] havoc main_#t~mem15.base, main_#t~mem15.offset; [L557] havoc main_#t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L544-L562] assume !!(0 != main_#t~nondet3); [L544] havoc main_#t~nondet3; [L545] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L546] call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L546] main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; [L546] assume !main_#t~short6; [L546-L551] assume !main_#t~short6; [L546] havoc main_#t~mem4.base, main_#t~mem4.offset; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5.base, main_#t~mem5.offset; [L552] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L552-L556] assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11); [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10.base, main_#t~mem10.offset; [L557] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L557-L561] assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16); [L557] havoc main_#t~mem15.base, main_#t~mem15.offset; [L557] havoc main_#t~nondet16; [L544-L562] COND FALSE !(!(0 != main_#t~nondet3)) [L544] havoc main_#t~nondet3; [L545] main_~n~0 := main_~root~0; [L546] FCALL call main_#t~mem4 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L546] main_#t~short6 := main_#t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(main_#t~short6) [L546-L551] COND TRUE !main_#t~short6 [L546] havoc main_#t~mem4; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5; [L552] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L552] COND FALSE !(main_#t~mem10 == { base: 0, offset: 0 } && 0 != main_#t~nondet11) [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10; [L557] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L557] COND FALSE !(main_#t~mem15 == { base: 0, offset: 0 } && 0 != main_#t~nondet16) [L557] havoc main_#t~mem15; [L557] havoc main_#t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L544-L562] COND FALSE !(!(0 != main_#t~nondet3)) [L544] havoc main_#t~nondet3; [L545] main_~n~0 := main_~root~0; [L546] FCALL call main_#t~mem4 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L546] main_#t~short6 := main_#t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(main_#t~short6) [L546-L551] COND TRUE !main_#t~short6 [L546] havoc main_#t~mem4; [L546] havoc main_#t~short6; [L546] havoc main_#t~mem5; [L552] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L552] COND FALSE !(main_#t~mem10 == { base: 0, offset: 0 } && 0 != main_#t~nondet11) [L552] havoc main_#t~nondet11; [L552] havoc main_#t~mem10; [L557] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L557] COND FALSE !(main_#t~mem15 == { base: 0, offset: 0 } && 0 != main_#t~nondet16) [L557] havoc main_#t~mem15; [L557] havoc main_#t~nondet16; [L544-L562] COND FALSE !(!(0 != #t~nondet3)) [L544] havoc #t~nondet3; [L545] ~n~0 := ~root~0; [L546] FCALL call #t~mem4 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L546] #t~short6 := #t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(#t~short6) [L546-L551] COND TRUE !#t~short6 [L546] havoc #t~mem4; [L546] havoc #t~short6; [L546] havoc #t~mem5; [L552] FCALL call #t~mem10 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L552] COND FALSE !(#t~mem10 == { base: 0, offset: 0 } && 0 != #t~nondet11) [L552] havoc #t~nondet11; [L552] havoc #t~mem10; [L557] FCALL call #t~mem15 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L557] COND FALSE !(#t~mem15 == { base: 0, offset: 0 } && 0 != #t~nondet16) [L557] havoc #t~mem15; [L557] havoc #t~nondet16; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L544-L562] COND FALSE !(!(0 != #t~nondet3)) [L544] havoc #t~nondet3; [L545] ~n~0 := ~root~0; [L546] FCALL call #t~mem4 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L546] #t~short6 := #t~mem4 != { base: 0, offset: 0 }; [L546] COND FALSE !(#t~short6) [L546-L551] COND TRUE !#t~short6 [L546] havoc #t~mem4; [L546] havoc #t~short6; [L546] havoc #t~mem5; [L552] FCALL call #t~mem10 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L552] COND FALSE !(#t~mem10 == { base: 0, offset: 0 } && 0 != #t~nondet11) [L552] havoc #t~nondet11; [L552] havoc #t~mem10; [L557] FCALL call #t~mem15 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L557] COND FALSE !(#t~mem15 == { base: 0, offset: 0 } && 0 != #t~nondet16) [L557] havoc #t~mem15; [L557] havoc #t~nondet16; [L544] COND TRUE __VERIFIER_nondet_int() [L545] n = root [L546] EXPR n->left [L546] n->left && n->right [L546] COND FALSE !(n->left && n->right) [L552] EXPR n->left [L552] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L557] EXPR n->right [L557] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) Loop: [L544] COND TRUE __VERIFIER_nondet_int() [L545] n = root [L546] EXPR n->left [L546] n->left && n->right [L546] COND FALSE !(n->left && n->right) [L552] EXPR n->left [L552] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L557] EXPR n->right [L557] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...