./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/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 9b66bca76c5a21a62f865fe4d9cdb8724001340a ............................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 18:05:18,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:05:18,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:05:18,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:05:18,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:05:18,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:05:18,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:05:18,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:05:18,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:05:18,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:05:18,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:05:18,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:05:18,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:05:18,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:05:18,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:05:18,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:05:18,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:05:18,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:05:18,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:05:18,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:05:18,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:05:18,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:05:18,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:05:18,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:05:18,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:05:18,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:05:18,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:05:18,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:05:18,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:05:18,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:05:18,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:05:18,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:05:18,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:05:18,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:05:18,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:05:18,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:05:18,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:05:18,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:05:18,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:05:18,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:05:18,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:05:18,753 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 18:05:18,764 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:05:18,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:05:18,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:05:18,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:05:18,765 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:05:18,766 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 18:05:18,766 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 18:05:18,766 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 18:05:18,766 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 18:05:18,766 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 18:05:18,766 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 18:05:18,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:05:18,766 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:05:18,767 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:05:18,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:05:18,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:05:18,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:05:18,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 18:05:18,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 18:05:18,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 18:05:18,767 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:05:18,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:05:18,768 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 18:05:18,768 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:05:18,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 18:05:18,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:05:18,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:05:18,768 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 18:05:18,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:05:18,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:05:18,769 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:05:18,769 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 18:05:18,769 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 18:05:18,769 INFO L138 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/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/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 -> 9b66bca76c5a21a62f865fe4d9cdb8724001340a [2019-12-07 18:05:18,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:05:18,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:05:18,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:05:18,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:05:18,878 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:05:18,878 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-12-07 18:05:18,918 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/data/532404362/0584a43dbd8b4400a987ba96fd4dacdb/FLAG3c3084acd [2019-12-07 18:05:19,352 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:05:19,352 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-12-07 18:05:19,361 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/data/532404362/0584a43dbd8b4400a987ba96fd4dacdb/FLAG3c3084acd [2019-12-07 18:05:19,705 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/data/532404362/0584a43dbd8b4400a987ba96fd4dacdb [2019-12-07 18:05:19,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:05:19,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:05:19,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:05:19,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:05:19,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:05:19,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:05:19" (1/1) ... [2019-12-07 18:05:19,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46581b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:19, skipping insertion in model container [2019-12-07 18:05:19,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:05:19" (1/1) ... [2019-12-07 18:05:19,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:05:19,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:05:19,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:05:19,972 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:05:20,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:05:20,034 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:05:20,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20 WrapperNode [2019-12-07 18:05:20,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:05:20,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:05:20,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:05:20,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:05:20,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... [2019-12-07 18:05:20,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... [2019-12-07 18:05:20,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:05:20,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:05:20,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:05:20,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:05:20,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... [2019-12-07 18:05:20,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... [2019-12-07 18:05:20,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... [2019-12-07 18:05:20,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... [2019-12-07 18:05:20,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... [2019-12-07 18:05:20,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... [2019-12-07 18:05:20,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... [2019-12-07 18:05:20,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:05:20,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:05:20,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:05:20,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:05:20,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/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 [2019-12-07 18:05:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:05:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:05:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:05:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:05:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:05:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:05:20,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:05:20,374 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:05:20,374 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:05:20,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:05:20 BoogieIcfgContainer [2019-12-07 18:05:20,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:05:20,375 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 18:05:20,375 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 18:05:20,378 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 18:05:20,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:05:20,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 06:05:19" (1/3) ... [2019-12-07 18:05:20,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d27f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:05:20, skipping insertion in model container [2019-12-07 18:05:20,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:05:20,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:20" (2/3) ... [2019-12-07 18:05:20,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d27f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:05:20, skipping insertion in model container [2019-12-07 18:05:20,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:05:20,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:05:20" (3/3) ... [2019-12-07 18:05:20,381 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2019-12-07 18:05:20,409 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 18:05:20,410 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 18:05:20,410 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 18:05:20,410 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:05:20,410 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:05:20,410 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 18:05:20,410 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:05:20,410 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 18:05:20,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-12-07 18:05:20,433 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-12-07 18:05:20,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:05:20,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:05:20,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:05:20,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:05:20,438 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 18:05:20,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-12-07 18:05:20,439 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-12-07 18:05:20,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:05:20,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:05:20,440 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:05:20,440 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:05:20,444 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#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~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, 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~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(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); 18#L538-2true [2019-12-07 18:05:20,445 INFO L796 eck$LassoCheckResult]: Loop: 18#L538-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; 3#L528-2true assume !true; 22#L527-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 7#L533true 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.allocOnHeap(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; 25#L533-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 27#L538true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 18#L538-2true [2019-12-07 18:05:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 18:05:20,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:20,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458167745] [2019-12-07 18:05:20,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:20,544 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-12-07 18:05:20,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:20,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513759070] [2019-12-07 18:05:20,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:20,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513759070] [2019-12-07 18:05:20,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:20,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:05:20,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675579689] [2019-12-07 18:05:20,572 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:05:20,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:20,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 18:05:20,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 18:05:20,583 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-12-07 18:05:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:20,588 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2019-12-07 18:05:20,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 18:05:20,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2019-12-07 18:05:20,591 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-12-07 18:05:20,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2019-12-07 18:05:20,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-12-07 18:05:20,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-12-07 18:05:20,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2019-12-07 18:05:20,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:05:20,595 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-12-07 18:05:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2019-12-07 18:05:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 18:05:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 18:05:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2019-12-07 18:05:20,613 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-12-07 18:05:20,613 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-12-07 18:05:20,613 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 18:05:20,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2019-12-07 18:05:20,614 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-12-07 18:05:20,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:05:20,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:05:20,614 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:05:20,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:20,615 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 75#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~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, 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~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(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); 63#L538-2 [2019-12-07 18:05:20,615 INFO L796 eck$LassoCheckResult]: Loop: 63#L538-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; 58#L528-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; 59#L527-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; 60#L527-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; 68#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 72#L533 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.allocOnHeap(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; 73#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 78#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 63#L538-2 [2019-12-07 18:05:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-12-07 18:05:20,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:20,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165370545] [2019-12-07 18:05:20,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:20,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-12-07 18:05:20,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:20,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838741968] [2019-12-07 18:05:20,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:20,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838741968] [2019-12-07 18:05:20,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:20,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:05:20,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665828337] [2019-12-07 18:05:20,693 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:05:20,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:20,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:05:20,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:20,694 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-12-07 18:05:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:20,782 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2019-12-07 18:05:20,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:05:20,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2019-12-07 18:05:20,784 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-12-07 18:05:20,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2019-12-07 18:05:20,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-12-07 18:05:20,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-12-07 18:05:20,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2019-12-07 18:05:20,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:05:20,787 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-12-07 18:05:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2019-12-07 18:05:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-12-07 18:05:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 18:05:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2019-12-07 18:05:20,789 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-12-07 18:05:20,789 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-12-07 18:05:20,789 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 18:05:20,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2019-12-07 18:05:20,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-12-07 18:05:20,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:05:20,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:05:20,790 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:05:20,790 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:20,791 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 135#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~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, 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~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(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); 123#L538-2 [2019-12-07 18:05:20,791 INFO L796 eck$LassoCheckResult]: Loop: 123#L538-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; 117#L528-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; 118#L527-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; 119#L527-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; 128#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L533 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; 133#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 138#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 123#L538-2 [2019-12-07 18:05:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:20,791 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-12-07 18:05:20,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:20,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357372289] [2019-12-07 18:05:20,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:20,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:20,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-12-07 18:05:20,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:20,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760319426] [2019-12-07 18:05:20,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:20,822 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:20,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-12-07 18:05:20,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:20,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173457878] [2019-12-07 18:05:20,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:20,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173457878] [2019-12-07 18:05:20,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:20,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:05:20,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966088146] [2019-12-07 18:05:20,985 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-12-07 18:05:21,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:21,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:05:21,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:21,046 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-12-07 18:05:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:21,174 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-12-07 18:05:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:05:21,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2019-12-07 18:05:21,176 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-12-07 18:05:21,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2019-12-07 18:05:21,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-12-07 18:05:21,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-12-07 18:05:21,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2019-12-07 18:05:21,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:05:21,179 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-12-07 18:05:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2019-12-07 18:05:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-12-07 18:05:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 18:05:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-12-07 18:05:21,182 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-12-07 18:05:21,182 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-12-07 18:05:21,182 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 18:05:21,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2019-12-07 18:05:21,183 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-12-07 18:05:21,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:05:21,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:05:21,184 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:05:21,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:21,184 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 214#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~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, 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~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(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); 215#L538-2 [2019-12-07 18:05:21,185 INFO L796 eck$LassoCheckResult]: Loop: 215#L538-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; 195#L528-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; 196#L527-1 assume !main_#t~short6; 197#L527-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; 226#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 224#L533 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; 223#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 222#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 215#L538-2 [2019-12-07 18:05:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-12-07 18:05:21,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:21,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503434567] [2019-12-07 18:05:21,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,201 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-12-07 18:05:21,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:21,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11765515] [2019-12-07 18:05:21,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,217 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-12-07 18:05:21,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:21,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955986198] [2019-12-07 18:05:21,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:21,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 06:05:21 BoogieIcfgContainer [2019-12-07 18:05:21,525 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 18:05:21,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:05:21,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:05:21,526 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:05:21,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:05:20" (3/4) ... [2019-12-07 18:05:21,528 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-12-07 18:05:21,557 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6e7f33b8-57c9-4294-9412-00c1cc4ba35c/bin/uautomizer/witness.graphml [2019-12-07 18:05:21,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:05:21,558 INFO L168 Benchmark]: Toolchain (without parser) took 1846.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 937.2 MB in the beginning and 870.4 MB in the end (delta: 66.8 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:21,559 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:05:21,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:21,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:21,561 INFO L168 Benchmark]: Boogie Preprocessor took 23.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:05:21,561 INFO L168 Benchmark]: RCFGBuilder took 282.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:21,562 INFO L168 Benchmark]: BuchiAutomizer took 1149.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 875.8 MB in the end (delta: 173.5 MB). Peak memory consumption was 173.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:21,563 INFO L168 Benchmark]: Witness Printer took 31.86 ms. Allocated memory is still 1.1 GB. Free memory was 875.8 MB in the beginning and 870.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:21,566 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 282.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1149.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 875.8 MB in the end (delta: 173.5 MB). Peak memory consumption was 173.5 MB. Max. memory is 11.5 GB. * Witness Printer took 31.86 ms. Allocated memory is still 1.1 GB. Free memory was 875.8 MB in the beginning and 870.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 34 SDslu, 75 SDs, 0 SdLazy, 124 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 525]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78dad89c=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@88b587f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6095d99e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ab74c4=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@49039af5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@49625d71=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@100ba2a0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71b3f61a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79a313a9=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@96372ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78dad89c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32d14ad1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25bdabf4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46d09799=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6513d438=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@628f4a3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@357cb7a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@96372ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d9c48ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25bdabf4=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ab74c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46d09799=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@100ba2a0=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e9bbaf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79a313a9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b345508=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2cd9b39f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6095d99e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a5d5c17=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37f4cb66=0, sentinel=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@49625d71=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d1869d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e9bbaf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@357cb7a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1c21a5ae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ab865c=0, succ=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12605a41=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2cd9b39f=0, s=0, sentinel=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@61b72368=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@49039af5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71b3f61a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ea7f066=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d1869d6=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1c21a5ae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ea7f066=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@61b72368=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@21a8929c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b345508=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d9c48ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@88b587f=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a5d5c17=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37f4cb66=0, pred=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@628f4a3=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 525]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L522] struct TreeNode* root = malloc(sizeof(*root)), *n; [L523] root->left = ((void *)0) [L524] root->right = ((void *)0) Loop: [L525] COND TRUE __VERIFIER_nondet_int() [L526] n = root [L527] EXPR n->left [L527] n->left && n->right [L527] COND FALSE !(n->left && n->right) [L533] EXPR n->left [L533] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L538] EXPR n->right [L538] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...