./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 f470102c 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.25-f470102 [2019-11-28 20:50:21,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:50:21,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:50:21,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:50:21,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:50:21,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:50:21,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:50:21,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:50:21,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:50:21,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:50:21,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:50:21,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:50:21,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:50:21,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:50:21,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:50:21,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:50:21,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:50:21,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:50:21,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:50:21,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:50:21,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:50:21,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:50:21,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:50:21,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:50:21,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:50:21,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:50:21,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:50:21,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:50:21,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:50:21,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:50:21,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:50:21,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:50:21,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:50:21,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:50:21,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:50:21,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:50:21,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:50:21,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:50:21,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:50:21,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:50:21,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:50:21,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:50:21,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:50:21,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:50:21,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:50:21,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:50:21,440 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:50:21,440 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:50:21,441 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:50:21,443 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:50:21,443 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:50:21,443 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:50:21,444 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:50:21,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:50:21,444 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:50:21,444 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:50:21,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:50:21,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:50:21,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:50:21,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:50:21,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:50:21,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:50:21,448 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:50:21,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:50:21,448 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:50:21,449 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:50:21,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:50:21,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:50:21,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:50:21,450 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:50:21,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:50:21,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:50:21,451 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:50:21,452 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:50:21,453 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:50:21,454 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 20:50:21,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:50:21,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:50:21,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:50:21,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:50:21,753 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:50:21,754 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 20:50:21,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b28013e46/31c117b694164a8a96d0a9468a16aba9/FLAGf388f1bf7 [2019-11-28 20:50:22,285 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:50:22,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested6.i [2019-11-28 20:50:22,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b28013e46/31c117b694164a8a96d0a9468a16aba9/FLAGf388f1bf7 [2019-11-28 20:50:22,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b28013e46/31c117b694164a8a96d0a9468a16aba9 [2019-11-28 20:50:22,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:50:22,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:50:22,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:50:22,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:50:22,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:50:22,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cffb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22, skipping insertion in model container [2019-11-28 20:50:22,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:50:22,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:50:22,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:50:22,897 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:50:22,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:50:22,935 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:50:22,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22 WrapperNode [2019-11-28 20:50:22,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:50:22,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:50:22,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:50:22,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:50:22,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:50:22,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:50:22,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:50:22,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:50:23,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:23,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:23,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:23,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:23,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:23,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:23,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:23,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:50:23,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:50:23,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:50:23,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:50:23,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (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 20:50:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:50:23,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:50:23,492 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:50:23,492 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 20:50:23,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:50:23 BoogieIcfgContainer [2019-11-28 20:50:23,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:50:23,495 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:50:23,495 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:50:23,498 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:50:23,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:50:23,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:50:22" (1/3) ... [2019-11-28 20:50:23,500 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d11224d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:50:23, skipping insertion in model container [2019-11-28 20:50:23,500 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:50:23,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (2/3) ... [2019-11-28 20:50:23,501 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d11224d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:50:23, skipping insertion in model container [2019-11-28 20:50:23,501 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:50:23,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:50:23" (3/3) ... [2019-11-28 20:50:23,503 INFO L371 chiAutomizerObserver]: Analyzing ICFG nested6.i [2019-11-28 20:50:23,555 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:50:23,556 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:50:23,556 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:50:23,556 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:50:23,557 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:50:23,557 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:50:23,557 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:50:23,557 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:50:23,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-28 20:50:23,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 20:50:23,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:23,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:23,599 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:50:23,599 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:50:23,599 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:50:23,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-28 20:50:23,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 20:50:23,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:23,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:23,602 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:50:23,602 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:50:23,609 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 20:50:23,609 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 20:50:23,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,614 INFO L82 PathProgramCache]: Analyzing trace with hash 959370, now seen corresponding path program 1 times [2019-11-28 20:50:23,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:23,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351538714] [2019-11-28 20:50:23,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:23,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,718 INFO L82 PathProgramCache]: Analyzing trace with hash 50890, now seen corresponding path program 1 times [2019-11-28 20:50:23,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:23,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678925505] [2019-11-28 20:50:23,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,738 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158303, now seen corresponding path program 1 times [2019-11-28 20:50:23,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:23,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246103558] [2019-11-28 20:50:23,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:23,824 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 20:50:23,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246103558] [2019-11-28 20:50:23,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:23,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:50:23,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989352512] [2019-11-28 20:50:23,886 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:23,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:23,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:23,887 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:23,887 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:23,888 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,888 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:23,888 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:23,888 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2019-11-28 20:50:23,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:23,888 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:23,907 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 20:50:23,937 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 20:50:23,997 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:23,998 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:24,007 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:24,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:24,279 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:24,282 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:24,282 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:24,282 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:24,282 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:24,282 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:24,283 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,283 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:24,283 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:24,283 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2019-11-28 20:50:24,283 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:24,283 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:24,285 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 20:50:24,304 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 20:50:24,368 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:24,375 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 20:50:24,392 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 20:50:24,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:24,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:24,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:24,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:24,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:24,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:24,404 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 20:50:24,413 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:24,443 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:50:24,443 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) [2019-11-28 20:50:24,466 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:24,466 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:24,467 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:24,467 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 20:50:24,475 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:24,525 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,541 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:24,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:24,562 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 20:50:24,581 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 20:50:24,583 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-11-28 20:50:24,671 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 20:50:24,672 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 20:50:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2019-11-28 20:50:24,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 20:50:24,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:24,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:50:24,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:24,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 20:50:24,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:24,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 90 transitions. [2019-11-28 20:50:24,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:50:24,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 26 states and 33 transitions. [2019-11-28 20:50:24,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:50:24,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:50:24,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-11-28 20:50:24,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:24,693 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 20:50:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-11-28 20:50:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-28 20:50:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:50:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-11-28 20:50:24,726 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-28 20:50:24,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:24,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:50:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:50:24,731 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2019-11-28 20:50:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:24,807 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-11-28 20:50:24,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:50:24,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-11-28 20:50:24,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-28 20:50:24,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2019-11-28 20:50:24,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 20:50:24,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 20:50:24,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-11-28 20:50:24,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:24,813 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-28 20:50:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-11-28 20:50:24,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2019-11-28 20:50:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 20:50:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 20:50:24,817 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 20:50:24,818 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 20:50:24,818 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:50:24,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-11-28 20:50:24,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:50:24,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:24,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:24,820 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:50:24,820 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:50:24,820 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 20:50:24,821 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 20:50:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 1 times [2019-11-28 20:50:24,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685110449] [2019-11-28 20:50:24,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,836 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:24,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1819467, now seen corresponding path program 1 times [2019-11-28 20:50:24,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33948103] [2019-11-28 20:50:24,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,877 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 20:50:24,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33948103] [2019-11-28 20:50:24,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:24,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:50:24,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767988386] [2019-11-28 20:50:24,880 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:50:24,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:24,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:50:24,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:50:24,882 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:50:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:24,933 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-28 20:50:24,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:50:24,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-11-28 20:50:24,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 20:50:24,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 20:50:24,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 20:50:24,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:50:24,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-11-28 20:50:24,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:24,940 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 20:50:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-11-28 20:50:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 20:50:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:50:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 20:50:24,947 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 20:50:24,947 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 20:50:24,947 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:50:24,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-11-28 20:50:24,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 20:50:24,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:24,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:24,951 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:50:24,951 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:50:24,952 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 20:50:24,952 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 20:50:24,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 2 times [2019-11-28 20:50:24,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83065771] [2019-11-28 20:50:24,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,981 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 1 times [2019-11-28 20:50:24,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796831741] [2019-11-28 20:50:24,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:25,044 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:25,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1589140493, now seen corresponding path program 1 times [2019-11-28 20:50:25,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:25,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271910071] [2019-11-28 20:50:25,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:25,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:25,183 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:25,184 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:25,184 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:25,184 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:25,184 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:25,184 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,185 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:25,185 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:25,185 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2019-11-28 20:50:25,185 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:25,185 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:25,192 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 20:50:25,208 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 20:50:25,212 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 20:50:25,216 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 20:50:25,290 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:25,290 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 20:50:25,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:25,296 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:25,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:25,637 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:25,639 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:25,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:25,640 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:25,640 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:25,640 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:25,640 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,640 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:25,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:25,640 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2019-11-28 20:50:25,641 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:25,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:25,643 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 20:50:25,663 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 20:50:25,666 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 20:50:25,677 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 20:50:25,851 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:25,851 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 20:50:25,865 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 20:50:25,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:25,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:25,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:25,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:25,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:25,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:25,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:25,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:25,878 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:50:25,878 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 20:50:25,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:25,890 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:25,890 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:25,890 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 [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:50:25,894 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 20:50:25,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,941 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,942 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,970 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 20:50:25,972 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 20:50:25,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 20:50:26,021 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 20:50:26,023 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 20:50:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 20:50:26,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 20:50:26,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:26,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-28 20:50:26,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:26,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 12 letters. [2019-11-28 20:50:26,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:26,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. [2019-11-28 20:50:26,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 20:50:26,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 56 states and 71 transitions. [2019-11-28 20:50:26,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 20:50:26,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 20:50:26,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 71 transitions. [2019-11-28 20:50:26,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:26,036 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2019-11-28 20:50:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 71 transitions. [2019-11-28 20:50:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-11-28 20:50:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:50:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-11-28 20:50:26,045 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-28 20:50:26,045 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-28 20:50:26,045 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:50:26,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2019-11-28 20:50:26,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 20:50:26,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:26,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:26,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:26,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:50:26,051 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 20:50:26,052 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 20:50:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158290, now seen corresponding path program 1 times [2019-11-28 20:50:26,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:26,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745973986] [2019-11-28 20:50:26,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,069 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:26,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,069 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 1 times [2019-11-28 20:50:26,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:26,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035796010] [2019-11-28 20:50:26,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734878, now seen corresponding path program 1 times [2019-11-28 20:50:26,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:26,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354095779] [2019-11-28 20:50:26,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:26,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:26,145 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:26,146 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:26,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:26,146 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:26,146 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:26,146 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:26,146 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:26,147 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:26,147 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2019-11-28 20:50:26,147 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:26,147 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:26,148 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 20:50:26,151 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 20:50:26,236 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:26,236 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:26,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:26,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:26,247 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:50:26,247 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:26,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:26,263 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:26,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:26,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:26,565 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:26,567 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:26,567 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:26,567 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:26,567 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:26,568 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:26,568 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:26,568 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:26,568 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:26,568 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2019-11-28 20:50:26,568 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:26,568 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:26,570 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 20:50:26,576 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 20:50:26,668 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:26,669 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) [2019-11-28 20:50:26,682 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 20:50:26,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:26,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:26,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:26,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:26,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:26,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:26,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:26,689 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:26,704 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 20:50:26,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:26,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:26,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:26,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:26,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:26,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:26,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:26,714 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:26,717 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:50:26,717 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 20:50:26,727 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:26,728 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:26,728 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:26,728 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 20:50:26,731 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:50:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:26,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:26,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:26,758 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:26,759 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:26,770 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 20:50:26,770 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 20:50:26,770 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-28 20:50:26,804 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 20:50:26,805 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 20:50:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-28 20:50:26,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:50:26,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:26,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 20:50:26,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:26,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-28 20:50:26,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:26,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 167 transitions. [2019-11-28 20:50:26,810 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2019-11-28 20:50:26,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 97 states and 121 transitions. [2019-11-28 20:50:26,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 20:50:26,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-28 20:50:26,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2019-11-28 20:50:26,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:26,813 INFO L688 BuchiCegarLoop]: Abstraction has 97 states and 121 transitions. [2019-11-28 20:50:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2019-11-28 20:50:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2019-11-28 20:50:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 20:50:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-11-28 20:50:26,821 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-11-28 20:50:26,822 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-11-28 20:50:26,822 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:50:26,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2019-11-28 20:50:26,823 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-28 20:50:26,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:26,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:26,823 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:26,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:50:26,824 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 20:50:26,824 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 20:50:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:26,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1340048366, now seen corresponding path program 1 times [2019-11-28 20:50:26,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:26,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313299904] [2019-11-28 20:50:26,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:26,892 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 20:50:26,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313299904] [2019-11-28 20:50:26,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309593293] [2019-11-28 20:50:26,893 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:50:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:26,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:50:26,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:27,003 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 20:50:27,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:50:27,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-28 20:50:27,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146112370] [2019-11-28 20:50:27,005 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:50:27,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:27,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 2 times [2019-11-28 20:50:27,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:27,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738431540] [2019-11-28 20:50:27,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:27,018 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:27,096 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:27,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:27,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:27,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:27,097 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:27,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:27,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:27,097 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:27,097 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2019-11-28 20:50:27,097 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:27,098 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:27,099 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 20:50:27,109 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 20:50:27,112 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 20:50:27,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Stream Closed [2019-11-28 20:50:27,235 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:27,235 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 20:50:27,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:27,251 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 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) [2019-11-28 20:50:27,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:27,272 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:27,656 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:27,658 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:27,658 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:27,658 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:27,659 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:27,659 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:27,659 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:27,659 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:27,659 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:27,659 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2019-11-28 20:50:27,659 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:27,659 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:27,661 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 20:50:27,669 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 20:50:27,677 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 20:50:27,679 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 20:50:27,735 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:27,735 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 20:50:27,741 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 20:50:27,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:27,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:27,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:27,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:27,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:27,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:27,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:27,749 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:27,754 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:50:27,755 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 20:50:27,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:27,758 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:27,759 INFO L510 LassoAnalysis]: Proved termination. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:27,759 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 [] [2019-11-28 20:50:27,761 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:50:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:27,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:27,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:27,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:27,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:27,808 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 20:50:27,808 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 20:50:27,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-28 20:50:27,841 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 20:50:27,841 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 20:50:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 20:50:27,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 20:50:27,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:27,842 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:27,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:27,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:27,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:27,869 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:27,870 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:27,879 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 20:50:27,879 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 20:50:27,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-28 20:50:27,904 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 20:50:27,906 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 20:50:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 20:50:27,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 20:50:27,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:27,907 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:27,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:27,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:27,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:27,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:27,939 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:27,953 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 20:50:27,954 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 20:50:27,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-28 20:50:27,985 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 20:50:27,986 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 20:50:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-11-28 20:50:27,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 20:50:27,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:27,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 20 letters. Loop has 6 letters. [2019-11-28 20:50:27,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:27,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 12 letters. [2019-11-28 20:50:27,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:27,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 154 transitions. [2019-11-28 20:50:27,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:50:27,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 74 states and 92 transitions. [2019-11-28 20:50:27,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 20:50:27,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 20:50:27,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 92 transitions. [2019-11-28 20:50:27,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:27,992 INFO L688 BuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2019-11-28 20:50:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 92 transitions. [2019-11-28 20:50:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2019-11-28 20:50:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:50:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-11-28 20:50:27,999 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-11-28 20:50:28,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:28,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:50:28,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:50:28,001 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2019-11-28 20:50:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:28,113 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2019-11-28 20:50:28,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:50:28,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 180 transitions. [2019-11-28 20:50:28,115 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 20:50:28,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 143 states and 176 transitions. [2019-11-28 20:50:28,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 20:50:28,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 20:50:28,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 176 transitions. [2019-11-28 20:50:28,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:28,118 INFO L688 BuchiCegarLoop]: Abstraction has 143 states and 176 transitions. [2019-11-28 20:50:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 176 transitions. [2019-11-28 20:50:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 60. [2019-11-28 20:50:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 20:50:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2019-11-28 20:50:28,123 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-11-28 20:50:28,123 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-11-28 20:50:28,123 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:50:28,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. [2019-11-28 20:50:28,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:50:28,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:28,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:28,125 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:28,125 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:50:28,125 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 20:50:28,126 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 20:50:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:28,126 INFO L82 PathProgramCache]: Analyzing trace with hash 279041640, now seen corresponding path program 1 times [2019-11-28 20:50:28,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:28,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115244446] [2019-11-28 20:50:28,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,175 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 20:50:28,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115244446] [2019-11-28 20:50:28,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255232927] [2019-11-28 20:50:28,176 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 20:50:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,213 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 20:50:28,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:50:28,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 20:50:28,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460812966] [2019-11-28 20:50:28,215 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:50:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:28,216 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 2 times [2019-11-28 20:50:28,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:28,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727463754] [2019-11-28 20:50:28,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:28,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:28,261 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:28,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:28,261 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:28,261 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:28,261 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:28,261 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,261 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:28,261 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:28,261 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2019-11-28 20:50:28,262 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:28,262 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:28,263 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 20:50:28,264 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 20:50:28,347 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:28,347 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 20:50:28,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:28,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:28,355 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:50:28,355 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 20:50:28,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:28,363 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:28,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:28,673 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:28,677 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:28,677 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:28,677 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:28,678 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:28,678 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:28,678 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,678 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:28,678 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:28,679 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2019-11-28 20:50:28,679 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:28,679 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:28,680 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 20:50:28,687 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 20:50:28,753 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:28,754 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) [2019-11-28 20:50:28,764 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 20:50:28,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:28,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:28,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:28,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:28,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:28,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:28,769 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 20:50:28,775 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 20:50:28,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:28,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:28,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:28,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:28,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:28,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:28,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:28,786 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:28,790 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:50:28,790 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:28,794 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:28,794 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:28,795 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:28,795 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 20:50:28,797 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:50:28,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,815 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,829 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 20:50:28,830 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 20:50:28,830 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-11-28 20:50:28,868 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 20:50:28,869 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 20:50:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-28 20:50:28,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 20:50:28,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:28,870 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,888 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,897 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,907 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 20:50:28,908 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 20:50:28,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-11-28 20:50:28,945 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 20:50:28,945 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 20:50:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-28 20:50:28,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 20:50:28,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:28,946 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:28,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:28,975 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:28,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:28,986 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 20:50:28,987 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 20:50:28,987 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-11-28 20:50:29,015 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 20:50:29,015 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 20:50:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-11-28 20:50:29,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 20:50:29,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:29,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-28 20:50:29,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:29,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 20:50:29,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:29,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 119 transitions. [2019-11-28 20:50:29,019 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:29,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 0 states and 0 transitions. [2019-11-28 20:50:29,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:50:29,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:50:29,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:50:29,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:29,020 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:29,020 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:29,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:29,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:50:29,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:50:29,020 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-11-28 20:50:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:29,021 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 20:50:29,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:50:29,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 20:50:29,021 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:29,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:50:29,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:50:29,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:50:29,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:50:29,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:29,022 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:29,022 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:29,022 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:29,022 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:50:29,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:50:29,023 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:29,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:50:29,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:50:29 BoogieIcfgContainer [2019-11-28 20:50:29,030 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:50:29,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:50:29,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:50:29,031 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:50:29,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:50:23" (3/4) ... [2019-11-28 20:50:29,036 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:50:29,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:50:29,039 INFO L168 Benchmark]: Toolchain (without parser) took 6405.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -51.7 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:29,040 INFO L168 Benchmark]: CDTParser took 0.26 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 20:50:29,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.96 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:29,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:50:29,042 INFO L168 Benchmark]: Boogie Preprocessor took 87.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:29,042 INFO L168 Benchmark]: RCFGBuilder took 425.89 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:29,043 INFO L168 Benchmark]: BuchiAutomizer took 5535.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.8 MB). Peak memory consumption was 182.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:29,044 INFO L168 Benchmark]: Witness Printer took 5.30 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 20:50:29,048 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.26 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 304.96 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 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 40.97 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 425.89 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5535.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.8 MB). Peak memory consumption was 182.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.30 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.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. 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: 90ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...