./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/nested6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/nested6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 934ee9c856a834ce808d29dea79c6912619f897f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:17:52,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:17:52,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:17:52,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:17:52,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:17:52,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:17:52,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:17:52,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:17:52,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:17:52,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:17:52,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:17:52,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:17:52,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:17:52,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:17:52,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:17:52,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:17:52,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:17:52,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:17:52,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:17:52,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:17:52,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:17:52,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:17:52,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:17:52,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:17:52,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:17:52,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:17:52,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:17:52,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:17:52,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:17:52,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:17:52,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:17:52,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:17:52,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:17:52,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:17:52,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:17:52,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:17:52,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:17:52,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:17:52,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:17:52,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:17:52,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:17:52,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:17:52,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:17:52,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:17:52,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:17:52,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:17:52,790 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:17:52,791 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:17:52,791 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:17:52,791 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:17:52,791 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:17:52,792 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:17:52,792 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:17:52,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:17:52,793 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:17:52,793 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:17:52,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:17:52,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:17:52,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:17:52,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:17:52,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:17:52,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:17:52,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:17:52,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:17:52,795 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:17:52,796 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:17:52,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:17:52,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:17:52,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:17:52,797 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:17:52,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:17:52,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:17:52,798 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:17:52,799 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:17:52,799 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 934ee9c856a834ce808d29dea79c6912619f897f [2019-11-28 03:17:53,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:17:53,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:17:53,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:17:53,130 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:17:53,131 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:17:53,132 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested6.i [2019-11-28 03:17:53,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a816a465/d3483e6cab4444d6b5451f22e3d2f531/FLAG0d929416c [2019-11-28 03:17:53,650 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:17:53,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested6.i [2019-11-28 03:17:53,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a816a465/d3483e6cab4444d6b5451f22e3d2f531/FLAG0d929416c [2019-11-28 03:17:54,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a816a465/d3483e6cab4444d6b5451f22e3d2f531 [2019-11-28 03:17:54,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:17:54,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:17:54,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:17:54,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:17:54,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:17:54,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a257051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54, skipping insertion in model container [2019-11-28 03:17:54,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:17:54,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:17:54,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:17:54,260 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:17:54,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:17:54,309 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:17:54,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54 WrapperNode [2019-11-28 03:17:54,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:17:54,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:17:54,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:17:54,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:17:54,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:17:54,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:17:54,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:17:54,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:17:54,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... [2019-11-28 03:17:54,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:17:54,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:17:54,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:17:54,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:17:54,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:17:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:17:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:17:54,789 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:17:54,790 INFO L297 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 03:17:54,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:54 BoogieIcfgContainer [2019-11-28 03:17:54,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:17:54,792 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:17:54,793 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:17:54,797 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:17:54,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:54,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:17:54" (1/3) ... [2019-11-28 03:17:54,800 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60e52929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:17:54, skipping insertion in model container [2019-11-28 03:17:54,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:54,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:54" (2/3) ... [2019-11-28 03:17:54,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60e52929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:17:54, skipping insertion in model container [2019-11-28 03:17:54,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:54,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:54" (3/3) ... [2019-11-28 03:17:54,804 INFO L371 chiAutomizerObserver]: Analyzing ICFG nested6.i [2019-11-28 03:17:54,867 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:17:54,868 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:17:54,868 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:17:54,869 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:17:54,869 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:17:54,869 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:17:54,870 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:17:54,870 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:17:54,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-28 03:17:54,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 03:17:54,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:54,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:54,935 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:17:54,936 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:54,936 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:17:54,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-28 03:17:54,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 03:17:54,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:54,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:54,941 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:17:54,941 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:54,947 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 21#L14true assume !!(main_~n~0 < 1000000); 3#L15true assume main_~k~0 == main_~n~0; 22#L15-1true main_~i~0 := 0; 5#L19-3true [2019-11-28 03:17:54,948 INFO L796 eck$LassoCheckResult]: Loop: 5#L19-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 8#L20-2true assume !(main_~j~0 < main_~n~0); 6#L19-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 5#L19-3true [2019-11-28 03:17:54,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash 959370, now seen corresponding path program 1 times [2019-11-28 03:17:54,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:54,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158041080] [2019-11-28 03:17:54,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:55,059 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:55,060 INFO L82 PathProgramCache]: Analyzing trace with hash 50890, now seen corresponding path program 1 times [2019-11-28 03:17:55,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:55,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638654992] [2019-11-28 03:17:55,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:55,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:55,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158303, now seen corresponding path program 1 times [2019-11-28 03:17:55,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:55,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180569734] [2019-11-28 03:17:55,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:55,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180569734] [2019-11-28 03:17:55,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:55,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:17:55,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70465655] [2019-11-28 03:17:55,238 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:55,239 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:55,239 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:55,239 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:55,239 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:55,240 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:55,240 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:55,240 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:55,240 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2019-11-28 03:17:55,240 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:55,241 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:55,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:55,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:55,349 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:55,350 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:55,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:55,366 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:55,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:55,382 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:55,639 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:17:55,642 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:55,642 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:55,642 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:55,642 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:55,643 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:55,643 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:55,643 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:55,643 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:55,643 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2019-11-28 03:17:55,643 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:55,643 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:55,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:55,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:55,725 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:55,730 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:55,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:55,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:55,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:55,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:55,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:55,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:55,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:55,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:55,755 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:55,764 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 03:17:55,764 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:55,772 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:55,773 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:17:55,773 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:55,774 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 03:17:55,780 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:17:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:55,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:55,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:55,835 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:55,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:55,870 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:17:55,871 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-11-28 03:17:55,952 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 63 states and 90 transitions. Complement of second has 7 states. [2019-11-28 03:17:55,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:17:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2019-11-28 03:17:55,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 03:17:55,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:55,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 03:17:55,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:55,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 03:17:55,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:55,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 90 transitions. [2019-11-28 03:17:55,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 03:17:55,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 26 states and 33 transitions. [2019-11-28 03:17:55,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:17:55,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:17:55,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-11-28 03:17:55,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:55,975 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 03:17:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-11-28 03:17:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-28 03:17:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 03:17:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-11-28 03:17:56,008 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-28 03:17:56,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:56,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:17:56,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:17:56,013 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2019-11-28 03:17:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:56,100 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-11-28 03:17:56,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:17:56,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-11-28 03:17:56,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-28 03:17:56,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2019-11-28 03:17:56,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 03:17:56,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:17:56,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-11-28 03:17:56,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:56,106 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-28 03:17:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-11-28 03:17:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2019-11-28 03:17:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 03:17:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 03:17:56,111 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 03:17:56,111 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 03:17:56,111 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:17:56,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-11-28 03:17:56,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 03:17:56,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:56,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:56,113 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:56,114 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:17:56,114 INFO L794 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 231#L14 assume !!(main_~n~0 < 1000000); 208#L15 assume main_~k~0 == main_~n~0; 209#L15-1 main_~i~0 := 0; 210#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 212#L20-2 [2019-11-28 03:17:56,114 INFO L796 eck$LassoCheckResult]: Loop: 212#L20-2 assume !!(main_~j~0 < main_~n~0); 218#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 222#L22-2 assume !(main_~k~0 < main_~n~0); 216#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 212#L20-2 [2019-11-28 03:17:56,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 1 times [2019-11-28 03:17:56,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:56,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449645611] [2019-11-28 03:17:56,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,139 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:56,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1819467, now seen corresponding path program 1 times [2019-11-28 03:17:56,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:56,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452581558] [2019-11-28 03:17:56,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:56,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452581558] [2019-11-28 03:17:56,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:56,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:17:56,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372364504] [2019-11-28 03:17:56,195 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:17:56,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:17:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:17:56,196 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:17:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:56,257 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-28 03:17:56,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:17:56,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-11-28 03:17:56,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 03:17:56,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 03:17:56,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:17:56,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:17:56,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-11-28 03:17:56,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:56,261 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 03:17:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-11-28 03:17:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 03:17:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:17:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 03:17:56,265 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 03:17:56,265 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 03:17:56,265 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:17:56,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-11-28 03:17:56,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 03:17:56,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:56,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:56,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:56,267 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:17:56,268 INFO L794 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 294#L14 assume !!(main_~n~0 < 1000000); 271#L15 assume main_~k~0 == main_~n~0; 272#L15-1 main_~i~0 := 0; 273#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 275#L20-2 [2019-11-28 03:17:56,268 INFO L796 eck$LassoCheckResult]: Loop: 275#L20-2 assume !!(main_~j~0 < main_~n~0); 281#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 291#L4-3 assume !(0 == __VERIFIER_assert_~cond); 289#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 283#L4-6 assume !(0 == __VERIFIER_assert_~cond); 279#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 275#L20-2 [2019-11-28 03:17:56,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 2 times [2019-11-28 03:17:56,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:56,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977712882] [2019-11-28 03:17:56,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 1 times [2019-11-28 03:17:56,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:56,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893300543] [2019-11-28 03:17:56,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,309 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:56,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:56,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1589140493, now seen corresponding path program 1 times [2019-11-28 03:17:56,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:56,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071444923] [2019-11-28 03:17:56,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,366 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:56,455 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:56,456 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:56,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:56,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:56,456 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:56,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:56,457 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:56,457 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:56,457 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2019-11-28 03:17:56,457 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:56,457 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:56,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:56,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:56,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:56,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:56,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:56,564 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:56,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:56,580 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:56,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:56,616 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:56,941 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:17:56,944 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:56,944 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:56,944 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:56,944 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:56,944 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:56,944 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:56,944 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:56,945 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:56,945 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2019-11-28 03:17:56,945 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:56,945 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:56,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:56,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:56,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:56,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:57,043 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:57,044 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:57,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:57,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:57,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:57,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:57,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:57,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:57,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:57,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:57,068 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:17:57,068 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:57,083 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:57,083 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:17:57,084 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:57,084 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 03:17:57,087 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:57,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:57,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:57,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:57,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:57,158 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:17:57,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 03:17:57,213 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 71 states and 90 transitions. Complement of second has 7 states. [2019-11-28 03:17:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:17:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 03:17:57,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 03:17:57,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:57,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-28 03:17:57,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:57,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 12 letters. [2019-11-28 03:17:57,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:57,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. [2019-11-28 03:17:57,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 03:17:57,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 56 states and 71 transitions. [2019-11-28 03:17:57,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:17:57,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 03:17:57,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 71 transitions. [2019-11-28 03:17:57,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:57,233 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2019-11-28 03:17:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 71 transitions. [2019-11-28 03:17:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-11-28 03:17:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 03:17:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-11-28 03:17:57,238 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-28 03:17:57,238 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-28 03:17:57,239 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:17:57,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2019-11-28 03:17:57,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 03:17:57,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:57,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:57,241 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:57,242 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:57,242 INFO L794 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 451#L14 assume !!(main_~n~0 < 1000000); 427#L15 assume main_~k~0 == main_~n~0; 428#L15-1 main_~i~0 := 0; 429#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 431#L20-2 assume !!(main_~j~0 < main_~n~0); 439#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 443#L22-2 [2019-11-28 03:17:57,242 INFO L796 eck$LassoCheckResult]: Loop: 443#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 444#L4 assume !(0 == __VERIFIER_assert_~cond); 453#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 443#L22-2 [2019-11-28 03:17:57,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158290, now seen corresponding path program 1 times [2019-11-28 03:17:57,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:57,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599989838] [2019-11-28 03:17:57,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 1 times [2019-11-28 03:17:57,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:57,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575118388] [2019-11-28 03:17:57,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,270 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734878, now seen corresponding path program 1 times [2019-11-28 03:17:57,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:57,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342775686] [2019-11-28 03:17:57,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:57,330 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:57,330 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:57,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:57,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:57,331 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:57,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:57,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:57,331 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2019-11-28 03:17:57,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:57,332 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:57,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:57,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:57,438 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:57,438 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:57,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:57,444 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:17:57,449 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:57,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:57,465 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:57,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:57,490 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,806 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:17:57,809 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:57,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:57,809 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:57,809 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:57,809 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:57,809 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,809 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:57,809 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:57,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2019-11-28 03:17:57,810 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:57,810 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:57,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:57,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:57,918 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:57,918 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:57,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:57,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:57,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:57,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:57,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:57,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:57,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:57,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:57,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:57,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:57,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:57,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:57,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:57,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:57,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:57,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:57,973 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:17:57,973 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:57,988 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:17:57,988 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:57,988 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 03:17:57,991 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:17:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:58,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:58,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:58,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:58,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:58,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:17:58,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-28 03:17:58,082 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 132 states and 167 transitions. Complement of second has 7 states. [2019-11-28 03:17:58,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:17:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-28 03:17:58,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 03:17:58,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:58,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 03:17:58,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:58,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-28 03:17:58,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:58,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 167 transitions. [2019-11-28 03:17:58,088 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2019-11-28 03:17:58,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 97 states and 121 transitions. [2019-11-28 03:17:58,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 03:17:58,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-28 03:17:58,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2019-11-28 03:17:58,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:58,091 INFO L688 BuchiCegarLoop]: Abstraction has 97 states and 121 transitions. [2019-11-28 03:17:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2019-11-28 03:17:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2019-11-28 03:17:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 03:17:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-11-28 03:17:58,100 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-11-28 03:17:58,101 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-11-28 03:17:58,101 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:17:58,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2019-11-28 03:17:58,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-28 03:17:58,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:58,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:58,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:58,105 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:17:58,105 INFO L794 eck$LassoCheckResult]: Stem: 682#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 683#L14 assume !!(main_~n~0 < 1000000); 656#L15 assume main_~k~0 == main_~n~0; 657#L15-1 main_~i~0 := 0; 658#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 659#L20-2 assume !!(main_~j~0 < main_~n~0); 703#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 708#L4-3 assume !(0 == __VERIFIER_assert_~cond); 707#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 706#L4-6 assume !(0 == __VERIFIER_assert_~cond); 705#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 699#L20-2 assume !(main_~j~0 < main_~n~0); 701#L19-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 698#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 697#L20-2 [2019-11-28 03:17:58,106 INFO L796 eck$LassoCheckResult]: Loop: 697#L20-2 assume !!(main_~j~0 < main_~n~0); 693#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 694#L4-3 assume !(0 == __VERIFIER_assert_~cond); 704#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 702#L4-6 assume !(0 == __VERIFIER_assert_~cond); 700#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 697#L20-2 [2019-11-28 03:17:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1340048366, now seen corresponding path program 1 times [2019-11-28 03:17:58,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:58,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62355169] [2019-11-28 03:17:58,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:58,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62355169] [2019-11-28 03:17:58,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237374069] [2019-11-28 03:17:58,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 03:17:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:58,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:17:58,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:58,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:58,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-28 03:17:58,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076019057] [2019-11-28 03:17:58,261 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 2 times [2019-11-28 03:17:58,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:58,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249156299] [2019-11-28 03:17:58,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:58,274 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:58,349 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:58,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:58,350 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:58,350 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:58,350 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:58,350 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:58,350 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:58,350 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:58,350 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2019-11-28 03:17:58,351 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:58,351 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:58,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:58,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:58,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:58,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:58,432 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:58,433 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:58,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:58,460 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:58,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:58,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:17:58,797 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:17:58,800 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:58,800 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:58,800 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:58,800 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:58,800 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:58,801 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:58,801 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:58,801 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:58,801 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2019-11-28 03:17:58,801 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:58,801 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:58,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:58,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:58,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:58,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:58,883 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:58,883 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:58,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:58,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:58,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:58,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:58,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:58,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:58,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:58,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:58,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:58,907 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 03:17:58,908 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:58,914 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:58,915 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:17:58,915 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:58,915 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:58,917 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:17:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:58,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:58,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:58,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:58,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:58,962 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:17:58,962 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-28 03:17:59,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 155 transitions. Complement of second has 7 states. [2019-11-28 03:17:59,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:17:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 03:17:59,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 03:17:59,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:59,014 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:17:59,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:59,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:59,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:59,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:59,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:59,064 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:17:59,064 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-28 03:17:59,092 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 155 transitions. Complement of second has 7 states. [2019-11-28 03:17:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:17:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 03:17:59,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 03:17:59,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:59,095 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:17:59,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:59,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:59,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:59,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:59,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:59,143 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:17:59,143 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-28 03:17:59,175 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 154 transitions. Complement of second has 6 states. [2019-11-28 03:17:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:17:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-11-28 03:17:59,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 03:17:59,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:59,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 20 letters. Loop has 6 letters. [2019-11-28 03:17:59,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:59,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 12 letters. [2019-11-28 03:17:59,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:59,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 154 transitions. [2019-11-28 03:17:59,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:17:59,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 74 states and 92 transitions. [2019-11-28 03:17:59,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:17:59,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:17:59,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 92 transitions. [2019-11-28 03:17:59,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:59,184 INFO L688 BuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2019-11-28 03:17:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 92 transitions. [2019-11-28 03:17:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2019-11-28 03:17:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 03:17:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-11-28 03:17:59,188 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-11-28 03:17:59,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:59,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 03:17:59,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 03:17:59,190 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2019-11-28 03:17:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:59,311 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2019-11-28 03:17:59,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:17:59,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 180 transitions. [2019-11-28 03:17:59,318 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 03:17:59,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 143 states and 176 transitions. [2019-11-28 03:17:59,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:17:59,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 03:17:59,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 176 transitions. [2019-11-28 03:17:59,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:59,320 INFO L688 BuchiCegarLoop]: Abstraction has 143 states and 176 transitions. [2019-11-28 03:17:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 176 transitions. [2019-11-28 03:17:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 60. [2019-11-28 03:17:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 03:17:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2019-11-28 03:17:59,326 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-11-28 03:17:59,326 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-11-28 03:17:59,326 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:17:59,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. [2019-11-28 03:17:59,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:17:59,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:59,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:59,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:59,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:59,328 INFO L794 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 1579#L14 assume !!(main_~n~0 < 1000000); 1558#L15 assume main_~k~0 == main_~n~0; 1559#L15-1 main_~i~0 := 0; 1560#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1562#L20-2 assume !!(main_~j~0 < main_~n~0); 1569#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 1573#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1574#L4 assume !(0 == __VERIFIER_assert_~cond); 1581#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1582#L22-2 assume !(main_~k~0 < main_~n~0); 1592#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1583#L20-2 assume !!(main_~j~0 < main_~n~0); 1576#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 1571#L22-2 [2019-11-28 03:17:59,329 INFO L796 eck$LassoCheckResult]: Loop: 1571#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1572#L4 assume !(0 == __VERIFIER_assert_~cond); 1580#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1571#L22-2 [2019-11-28 03:17:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:59,329 INFO L82 PathProgramCache]: Analyzing trace with hash 279041640, now seen corresponding path program 1 times [2019-11-28 03:17:59,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:59,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894458274] [2019-11-28 03:17:59,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:59,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894458274] [2019-11-28 03:17:59,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616622654] [2019-11-28 03:17:59,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:59,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:17:59,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:59,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:59,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 03:17:59,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777004072] [2019-11-28 03:17:59,403 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:59,403 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 2 times [2019-11-28 03:17:59,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:59,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551111257] [2019-11-28 03:17:59,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:59,432 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:59,459 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:59,459 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:59,459 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:59,460 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:59,460 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:59,460 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:59,460 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:59,460 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:59,461 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2019-11-28 03:17:59,461 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:59,461 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:59,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:59,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:59,560 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:59,560 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:59,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:59,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:17:59,568 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:17:59,568 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:59,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:59,577 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:59,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:59,590 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:00,143 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:18:00,145 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:18:00,146 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:18:00,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:18:00,146 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:18:00,146 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:18:00,146 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:00,146 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:18:00,146 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:18:00,146 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2019-11-28 03:18:00,146 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:18:00,147 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:18:00,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:18:00,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:18:00,230 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:18:00,231 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:00,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:18:00,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:18:00,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:18:00,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:18:00,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:18:00,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:18:00,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:18:00,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:18:00,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:00,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:18:00,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:18:00,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:18:00,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:18:00,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:18:00,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:18:00,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:18:00,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:18:00,262 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:18:00,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:18:00,270 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:18:00,276 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:18:00,276 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:18:00,276 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:18:00,277 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 03:18:00,279 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:00,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:00,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:00,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:18:00,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:18:00,320 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:18:00,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-11-28 03:18:00,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 115 states and 147 transitions. Complement of second has 7 states. [2019-11-28 03:18:00,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:18:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:18:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-28 03:18:00,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 03:18:00,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:00,366 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:18:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:00,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:00,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:00,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:18:00,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:18:00,403 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:18:00,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-11-28 03:18:00,428 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 115 states and 147 transitions. Complement of second has 7 states. [2019-11-28 03:18:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:18:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:18:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-28 03:18:00,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 03:18:00,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:00,430 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:18:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:00,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:00,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:00,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:18:00,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:18:00,463 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:18:00,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-11-28 03:18:00,501 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 94 states and 119 transitions. Complement of second has 6 states. [2019-11-28 03:18:00,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:18:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:18:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-11-28 03:18:00,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 03:18:00,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:00,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-28 03:18:00,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:00,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 03:18:00,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:00,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 119 transitions. [2019-11-28 03:18:00,505 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:18:00,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 0 states and 0 transitions. [2019-11-28 03:18:00,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:18:00,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:18:00,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:18:00,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:18:00,506 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:18:00,506 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:18:00,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:18:00,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:18:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:18:00,507 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-11-28 03:18:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:18:00,508 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 03:18:00,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:18:00,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 03:18:00,508 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:18:00,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 03:18:00,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:18:00,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:18:00,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:18:00,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:18:00,509 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:18:00,509 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:18:00,509 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:18:00,509 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:18:00,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:18:00,510 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:18:00,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:18:00,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:18:00 BoogieIcfgContainer [2019-11-28 03:18:00,515 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:18:00,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:18:00,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:18:00,516 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:18:00,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:54" (3/4) ... [2019-11-28 03:18:00,520 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:18:00,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:18:00,522 INFO L168 Benchmark]: Toolchain (without parser) took 6505.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -47.5 MB). Peak memory consumption was 165.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:00,523 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:18:00,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.39 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:00,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.63 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:18:00,525 INFO L168 Benchmark]: Boogie Preprocessor took 130.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:00,526 INFO L168 Benchmark]: RCFGBuilder took 296.75 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:00,527 INFO L168 Benchmark]: BuchiAutomizer took 5723.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.7 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:00,528 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:18:00,532 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.39 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.63 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 296.75 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5723.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.7 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. 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 9 terminating modules (4 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * j + n and consists of 4 locations. One deterministic module has affine ranking function -1 * k + n and consists of 4 locations. One nondeterministic module has affine ranking function n + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * k + n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 173 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 189 SDtfs, 349 SDslu, 123 SDs, 0 SdLazy, 297 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf98 lsp85 ukn100 mio100 lsp100 div100 bol100 ite114 ukn100 eq152 hnf93 smp82 dnf100 smp100 tf107 neg99 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 42ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...