./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash b98f7fd40026cd249d1c292b5307435abc3c32a2 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:33,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:33,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:33,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:33,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:33,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:33,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:33,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:33,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:33,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:33,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:33,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:33,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:33,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:33,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:33,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:33,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:33,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:33,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:33,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:33,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:33,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:33,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:33,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:33,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:33,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:33,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:33,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:33,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:33,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:33,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:33,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:33,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:33,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:33,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:33,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:33,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:33,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:33,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:33,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:33,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:33,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:33,465 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:33,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:33,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:33,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:33,467 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:33,467 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:33,468 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:33,468 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:33,468 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:33,468 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:33,469 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:33,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:33,469 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:33,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:33,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:33,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:33,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:33,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:33,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:33,471 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:33,471 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:33,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:33,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:33,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:33,473 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:33,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:33,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:33,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:33,474 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:33,475 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:33,475 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b98f7fd40026cd249d1c292b5307435abc3c32a2 [2020-07-29 01:28:33,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:33,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:33,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:33,875 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:33,878 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:33,880 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c [2020-07-29 01:28:33,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac079d905/b65aad12f4af4f6ba73c5fb9d2ca7a9d/FLAGb332ee163 [2020-07-29 01:28:34,447 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:34,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c [2020-07-29 01:28:34,455 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac079d905/b65aad12f4af4f6ba73c5fb9d2ca7a9d/FLAGb332ee163 [2020-07-29 01:28:34,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac079d905/b65aad12f4af4f6ba73c5fb9d2ca7a9d [2020-07-29 01:28:34,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:34,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:34,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:34,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:34,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:34,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:34" (1/1) ... [2020-07-29 01:28:34,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cea028f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:34, skipping insertion in model container [2020-07-29 01:28:34,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:34" (1/1) ... [2020-07-29 01:28:34,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:34,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:35,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:35,053 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:35,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:35,091 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:35,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35 WrapperNode [2020-07-29 01:28:35,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:35,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:35,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:35,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:35,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (1/1) ... [2020-07-29 01:28:35,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (1/1) ... [2020-07-29 01:28:35,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:35,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:35,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:35,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:35,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (1/1) ... [2020-07-29 01:28:35,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (1/1) ... [2020-07-29 01:28:35,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (1/1) ... [2020-07-29 01:28:35,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (1/1) ... [2020-07-29 01:28:35,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (1/1) ... [2020-07-29 01:28:35,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (1/1) ... [2020-07-29 01:28:35,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (1/1) ... [2020-07-29 01:28:35,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:35,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:35,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:35,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:35,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (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 [2020-07-29 01:28:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:35,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:35,499 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:35,499 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:28:35,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:35 BoogieIcfgContainer [2020-07-29 01:28:35,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:35,504 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:35,504 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:35,508 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:35,509 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:35,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:34" (1/3) ... [2020-07-29 01:28:35,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cbc6eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:35, skipping insertion in model container [2020-07-29 01:28:35,511 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:35,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:35" (2/3) ... [2020-07-29 01:28:35,512 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cbc6eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:35, skipping insertion in model container [2020-07-29 01:28:35,512 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:35,512 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:35" (3/3) ... [2020-07-29 01:28:35,514 INFO L371 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig9a.c [2020-07-29 01:28:35,582 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:35,582 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:35,582 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:35,582 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:35,584 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:35,585 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:35,585 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:35,586 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:35,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:28:35,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:35,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:35,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:35,646 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:35,646 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:35,646 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:35,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:28:35,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:35,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:35,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:35,651 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:35,651 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:35,661 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 10#L20true assume main_~k~0 >= 1;main_~i~0 := 0; 11#L22-2true [2020-07-29 01:28:35,662 INFO L796 eck$LassoCheckResult]: Loop: 11#L22-2true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 5#L24-2true assume !(main_~j~0 <= main_~i~0); 3#L24-3true main_~i~0 := 1 + main_~i~0; 11#L22-2true [2020-07-29 01:28:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2020-07-29 01:28:35,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:35,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847698929] [2020-07-29 01:28:35,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,802 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash 42930, now seen corresponding path program 1 times [2020-07-29 01:28:35,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:35,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254906957] [2020-07-29 01:28:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,827 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:35,830 INFO L82 PathProgramCache]: Analyzing trace with hash 29684975, now seen corresponding path program 1 times [2020-07-29 01:28:35,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:35,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944376130] [2020-07-29 01:28:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:35,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {17#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {17#true} is VALID [2020-07-29 01:28:35,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {17#true} assume main_~k~0 >= 1;main_~i~0 := 0; {19#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:28:35,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#(<= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {20#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:28:35,944 INFO L280 TraceCheckUtils]: 3: Hoare triple {20#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} assume !(main_~j~0 <= main_~i~0); {18#false} is VALID [2020-07-29 01:28:35,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {18#false} main_~i~0 := 1 + main_~i~0; {18#false} is VALID [2020-07-29 01:28:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:35,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944376130] [2020-07-29 01:28:35,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:28:35,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:28:35,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423776762] [2020-07-29 01:28:36,009 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:36,011 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:36,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:36,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:36,012 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:36,012 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:36,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:36,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration1_Loop [2020-07-29 01:28:36,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:36,014 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:36,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,254 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:36,255 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) [2020-07-29 01:28:36,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,262 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:36,275 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:28:36,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,315 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,320 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:36,320 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:28:36,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,358 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:36,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:36,402 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,567 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:36,569 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:36,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:36,569 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:36,569 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:36,570 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:36,570 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,570 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:36,570 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:36,570 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration1_Loop [2020-07-29 01:28:36,570 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:36,571 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:36,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,740 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:36,746 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:28:36,751 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 [2020-07-29 01:28:36,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:36,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:36,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:36,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:36,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:36,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,767 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:36,805 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 [2020-07-29 01:28:36,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:36,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:36,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:36,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:36,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:36,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,817 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:36,864 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 [2020-07-29 01:28:36,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:36,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:36,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:36,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:36,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:36,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:36,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,875 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:36,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:36,882 INFO L444 ModelExtractionUtils]: 2 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:36,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:36,908 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:36,908 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:36,909 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,947 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:36,952 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0;" "assume !(main_~j~0 <= main_~i~0);" "main_~i~0 := 1 + main_~i~0;" [2020-07-29 01:28:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,010 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {21#unseeded} is VALID [2020-07-29 01:28:37,011 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume main_~k~0 >= 1;main_~i~0 := 0; {21#unseeded} is VALID [2020-07-29 01:28:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,017 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {42#(and (<= 0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-29 01:28:37,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#(and (<= 0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= ULTIMATE.start_main_~j~0 0))} assume !(main_~j~0 <= main_~i~0); {46#(and (<= 0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= (+ ULTIMATE.start_main_~i~0 1) 0))} is VALID [2020-07-29 01:28:37,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#(and (<= 0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= (+ ULTIMATE.start_main_~i~0 1) 0))} main_~i~0 := 1 + main_~i~0; {34#(or unseeded (and (>= oldRank0 0) (> oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))))} is VALID [2020-07-29 01:28:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:37,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:37,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:37,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:37,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,170 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:28:37,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2020-07-29 01:28:37,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 35 states and 53 transitions. Complement of second has 9 states. [2020-07-29 01:28:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:37,341 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:28:37,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:37,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:37,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:28:37,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 53 transitions. [2020-07-29 01:28:37,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:37,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,358 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:28:37,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:37,361 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:37,361 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:37,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:28:37,365 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:37,365 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 53 transitions. cyclomatic complexity: 21 [2020-07-29 01:28:37,366 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:37,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:37,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:37,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:37,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:37,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:37,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:37,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:37,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:37,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:37,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:37,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:37,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:37,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:37,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:37,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:37,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:37,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:37,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:37,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:37,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:37,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:37,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:37,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:37,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:37,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:37,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:37,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:37,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:37,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:37,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:37,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:37,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:37,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:37,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:37,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:37,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:37,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:37,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:37,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,403 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2020-07-29 01:28:37,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:37,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:37,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:28:37,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. cyclomatic complexity: 21 [2020-07-29 01:28:37,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:37,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 14 states and 19 transitions. [2020-07-29 01:28:37,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:28:37,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:28:37,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-07-29 01:28:37,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:37,434 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:28:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-07-29 01:28:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-29 01:28:37,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:37,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand 13 states. [2020-07-29 01:28:37,467 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand 13 states. [2020-07-29 01:28:37,469 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 13 states. [2020-07-29 01:28:37,474 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:37,477 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:28:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:28:37,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:37,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:37,480 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states and 19 transitions. [2020-07-29 01:28:37,480 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states and 19 transitions. [2020-07-29 01:28:37,481 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:37,485 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2020-07-29 01:28:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2020-07-29 01:28:37,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:37,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:37,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:37,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:28:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-07-29 01:28:37,492 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:28:37,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:37,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:28:37,498 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 4 states. [2020-07-29 01:28:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:37,568 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:28:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:28:37,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:37,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:37,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2020-07-29 01:28:37,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:37,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2020-07-29 01:28:37,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:28:37,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:28:37,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-07-29 01:28:37,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:37,585 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:28:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-07-29 01:28:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-07-29 01:28:37,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:37,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 01:28:37,589 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 01:28:37,589 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 01:28:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:37,591 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:28:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:28:37,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:37,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:37,595 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states and 8 transitions. [2020-07-29 01:28:37,595 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states and 8 transitions. [2020-07-29 01:28:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:37,599 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:28:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:28:37,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:37,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:37,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:37,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:28:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:28:37,603 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:28:37,603 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:28:37,603 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:37,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:28:37,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:37,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,605 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:37,605 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:37,606 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 188#L20 assume main_~k~0 >= 1;main_~i~0 := 0; 186#L22-2 [2020-07-29 01:28:37,606 INFO L796 eck$LassoCheckResult]: Loop: 186#L22-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 189#L24-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 190#L24-2 assume !(main_~j~0 <= main_~i~0); 185#L24-3 main_~i~0 := 1 + main_~i~0; 186#L22-2 [2020-07-29 01:28:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 2 times [2020-07-29 01:28:37,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:37,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536947781] [2020-07-29 01:28:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,639 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:37,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1332592, now seen corresponding path program 1 times [2020-07-29 01:28:37,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:37,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243826900] [2020-07-29 01:28:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,688 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,691 INFO L82 PathProgramCache]: Analyzing trace with hash 920235987, now seen corresponding path program 1 times [2020-07-29 01:28:37,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:37,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518644147] [2020-07-29 01:28:37,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:37,769 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:37,769 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:37,769 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:37,769 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:37,770 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:37,770 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,770 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:37,770 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:37,771 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration2_Loop [2020-07-29 01:28:37,771 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:37,771 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:37,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,944 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:37,944 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) [2020-07-29 01:28:37,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:37,957 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,963 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:37,964 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=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 [2020-07-29 01:28:38,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:38,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:38,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:38,016 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2020-07-29 01:28:38,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:38,057 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2020-07-29 01:28:38,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:38,109 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,492 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:38,497 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:38,497 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:38,497 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:38,497 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:38,497 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:38,497 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:38,498 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:38,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration2_Loop [2020-07-29 01:28:38,498 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:38,498 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:38,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:38,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:38,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:38,654 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:38,655 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-07-29 01:28:38,661 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 [2020-07-29 01:28:38,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:38,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:38,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:38,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:38,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:38,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:38,677 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 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 [2020-07-29 01:28:38,714 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 [2020-07-29 01:28:38,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:38,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:38,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:38,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:38,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:38,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:38,724 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,752 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 [2020-07-29 01:28:38,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:38,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:38,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:38,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:38,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:38,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:38,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:38,760 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:38,771 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:38,771 INFO L444 ModelExtractionUtils]: 3 out of 6 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:38,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:38,775 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:38,775 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:38,776 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:38,806 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:38,811 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0;" "assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0;" "assume !(main_~j~0 <= main_~i~0);" "main_~i~0 := 1 + main_~i~0;" [2020-07-29 01:28:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:38,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {214#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {214#unseeded} is VALID [2020-07-29 01:28:38,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {214#unseeded} assume main_~k~0 >= 1;main_~i~0 := 0; {214#unseeded} is VALID [2020-07-29 01:28:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:38,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {217#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~n~0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {235#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:38,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {235#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; {235#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:38,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {235#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} assume !(main_~j~0 <= main_~i~0); {235#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:38,974 INFO L280 TraceCheckUtils]: 3: Hoare triple {235#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} main_~i~0 := 1 + main_~i~0; {227#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~n~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:28:38,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:38,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:38,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:38,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,982 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 [2020-07-29 01:28:38,983 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-07-29 01:28:39,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 4 states. [2020-07-29 01:28:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:39,016 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:39,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 2 [2020-07-29 01:28:39,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:39,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:39,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:39,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:39,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:39,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:39,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:28:39,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:39,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:39,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:39,020 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 7 transitions. cyclomatic complexity: 2 [2020-07-29 01:28:39,020 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:39,021 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:39,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:39,021 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:39,021 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:39,022 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:39,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:39,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:39,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:39,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:39,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:39,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:39,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:39,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:39,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:39,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:39,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:39,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:39,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:39,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:39,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:39,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:39,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:39,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:39,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:39,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:39,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:39,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:39,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:39,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:39,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:39,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:39,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:39,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:39,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:39,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:39,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:39,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:39,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:39,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:39,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:39,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:39,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,032 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:28:39,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:39,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:39,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:28:39,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:39,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:39,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:39,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 12 transitions. [2020-07-29 01:28:39,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:28:39,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:39,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-07-29 01:28:39,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:39,035 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-07-29 01:28:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-07-29 01:28:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-29 01:28:39,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:39,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:28:39,037 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:28:39,037 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:28:39,037 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:39,038 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:28:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:28:39,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:39,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:39,039 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states and 12 transitions. [2020-07-29 01:28:39,039 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states and 12 transitions. [2020-07-29 01:28:39,039 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:39,040 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:28:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:28:39,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:39,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:39,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:39,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:28:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-29 01:28:39,042 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:39,042 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:39,042 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:39,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:39,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:39,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:39,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:39,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:39,043 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:39,043 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 264#L20 assume main_~k~0 >= 1;main_~i~0 := 0; 268#L22-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 265#L24-2 [2020-07-29 01:28:39,043 INFO L796 eck$LassoCheckResult]: Loop: 265#L24-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 265#L24-2 [2020-07-29 01:28:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:39,044 INFO L82 PathProgramCache]: Analyzing trace with hash 30889, now seen corresponding path program 1 times [2020-07-29 01:28:39,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:39,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681618514] [2020-07-29 01:28:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:39,049 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:39,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:39,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:39,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:39,055 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2020-07-29 01:28:39,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:39,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502456268] [2020-07-29 01:28:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:39,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:39,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:39,062 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2020-07-29 01:28:39,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:39,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751485675] [2020-07-29 01:28:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:39,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:39,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:39,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:39,153 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:39,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:39,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:39,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:39,153 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:39,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:39,154 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:39,154 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration3_Lasso [2020-07-29 01:28:39,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:39,154 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:39,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:39,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:39,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:39,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:39,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:39,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:39,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:39,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:39,420 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:39,420 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,427 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,427 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,430 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,430 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2020-07-29 01:28:39,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,458 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,458 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,493 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,493 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,521 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,521 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2020-07-29 01:28:39,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,547 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,547 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=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 [2020-07-29 01:28:39,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,577 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,577 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2020-07-29 01:28:39,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:39,605 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:39,605 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:39,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:39,629 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 [2020-07-29 01:28:39,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:39,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:40,202 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:40,204 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:40,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:40,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:40,204 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:40,204 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:40,204 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:40,204 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:40,204 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:40,204 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration3_Lasso [2020-07-29 01:28:40,204 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:40,205 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:40,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,461 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:40,462 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-07-29 01:28:40,469 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 [2020-07-29 01:28:40,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:40,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:40,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:40,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:40,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:40,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:40,485 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:40,509 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:28:40,509 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:40,512 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:40,517 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-07-29 01:28:40,517 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:40,517 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~k~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~k~0 - 2*ULTIMATE.start_main_~i~0 - 1 >= 0, 1*ULTIMATE.start_main_~k~0 - 1 >= 0] [2020-07-29 01:28:40,545 INFO L297 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2020-07-29 01:28:40,553 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0;" [2020-07-29 01:28:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:40,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {320#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {320#unseeded} is VALID [2020-07-29 01:28:40,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#unseeded} assume main_~k~0 >= 1;main_~i~0 := 0; {357#(and (<= ULTIMATE.start_main_~i~0 0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:40,632 INFO L280 TraceCheckUtils]: 2: Hoare triple {357#(and (<= ULTIMATE.start_main_~i~0 0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {345#(and (>= (+ ULTIMATE.start_main_~k~0 (* (- 2) ULTIMATE.start_main_~i~0) (- 1)) 0) (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,636 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:40,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:40,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#(and (>= (+ ULTIMATE.start_main_~k~0 (* (- 2) ULTIMATE.start_main_~i~0) (- 1)) 0) (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= oldRank0 (+ ULTIMATE.start_main_~k~0 (* (- 2) ULTIMATE.start_main_~j~0))))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; {348#(and (>= (+ ULTIMATE.start_main_~k~0 (* (- 2) ULTIMATE.start_main_~i~0) (- 1)) 0) (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (or (and (> oldRank0 (+ ULTIMATE.start_main_~k~0 (* (- 2) ULTIMATE.start_main_~j~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:28:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:40,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:40,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:40,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:40,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,652 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:28:40,653 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:28:40,722 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 14 states and 18 transitions. Complement of second has 6 states. [2020-07-29 01:28:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:40,722 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:40,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:40,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:40,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:40,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-07-29 01:28:40,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:40,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,725 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:40,725 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:40,725 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:40,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:40,726 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:40,726 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:40,726 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:40,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:40,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:40,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:40,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:40,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:40,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:40,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:40,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:40,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:40,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:40,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:40,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:40,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:40,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:40,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:40,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:40,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:40,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:40,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:40,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:40,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,732 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-07-29 01:28:40,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:40,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:40,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:40,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:40,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:40,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:40,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 11 states and 14 transitions. [2020-07-29 01:28:40,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:28:40,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:28:40,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 01:28:40,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:40,737 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:28:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 01:28:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2020-07-29 01:28:40,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:40,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 8 states. [2020-07-29 01:28:40,738 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 8 states. [2020-07-29 01:28:40,738 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 8 states. [2020-07-29 01:28:40,739 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:40,740 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-29 01:28:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-29 01:28:40,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:40,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:40,740 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 11 states and 14 transitions. [2020-07-29 01:28:40,741 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 11 states and 14 transitions. [2020-07-29 01:28:40,741 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:40,742 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-29 01:28:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-29 01:28:40,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:40,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:40,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:40,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:28:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 01:28:40,744 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:28:40,744 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:28:40,744 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:40,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:28:40,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:40,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:40,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:40,745 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-07-29 01:28:40,745 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:40,746 INFO L794 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 388#L20 assume main_~k~0 >= 1;main_~i~0 := 0; 392#L22-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 390#L24-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 391#L24-2 assume !(main_~j~0 <= main_~i~0); 385#L24-3 main_~i~0 := 1 + main_~i~0; 386#L22-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 389#L24-2 [2020-07-29 01:28:40,746 INFO L796 eck$LassoCheckResult]: Loop: 389#L24-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 389#L24-2 [2020-07-29 01:28:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1537455462, now seen corresponding path program 2 times [2020-07-29 01:28:40,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:40,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158110624] [2020-07-29 01:28:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,762 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:40,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,763 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2020-07-29 01:28:40,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:40,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244792051] [2020-07-29 01:28:40,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:40,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash -416479044, now seen corresponding path program 3 times [2020-07-29 01:28:40,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:40,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336795014] [2020-07-29 01:28:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:40,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:40,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:40,880 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:40,880 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:40,880 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:40,880 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:40,880 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:40,880 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:40,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:40,881 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:40,881 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration4_Lasso [2020-07-29 01:28:40,881 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:40,881 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:40,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:40,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:41,120 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:41,120 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:41,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:41,127 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:41,127 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:41,152 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:41,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:41,197 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,786 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:41,788 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:41,788 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:41,788 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:41,788 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:41,788 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:41,789 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:41,789 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:41,789 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:41,789 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a.c_Iteration4_Lasso [2020-07-29 01:28:41,789 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:41,789 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:41,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:41,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:41,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:41,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:41,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:41,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:41,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:41,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:42,050 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:42,051 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:42,054 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 [2020-07-29 01:28:42,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:42,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:42,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,061 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,085 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 [2020-07-29 01:28:42,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:42,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:42,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:42,091 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,118 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 [2020-07-29 01:28:42,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:42,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:42,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:42,122 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,147 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 [2020-07-29 01:28:42,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:42,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:42,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:42,158 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,181 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 [2020-07-29 01:28:42,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:42,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:42,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:42,186 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,208 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 [2020-07-29 01:28:42,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:42,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:42,218 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,240 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 [2020-07-29 01:28:42,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:42,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:42,257 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:42,273 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:28:42,274 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:42,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,280 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-07-29 01:28:42,280 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:42,281 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~i~0 - 1 >= 0, 1*ULTIMATE.start_main_~k~0 - 1 >= 0] [2020-07-29 01:28:42,311 INFO L297 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2020-07-29 01:28:42,318 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0;" [2020-07-29 01:28:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:42,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {463#unseeded} is VALID [2020-07-29 01:28:42,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#unseeded} assume main_~k~0 >= 1;main_~i~0 := 0; {500#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {500#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {500#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,461 INFO L280 TraceCheckUtils]: 3: Hoare triple {500#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; {500#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {500#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !(main_~j~0 <= main_~i~0); {500#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,463 INFO L280 TraceCheckUtils]: 5: Hoare triple {500#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} main_~i~0 := 1 + main_~i~0; {488#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:42,464 INFO L280 TraceCheckUtils]: 6: Hoare triple {488#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {488#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,467 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:42,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {489#(and (>= oldRank0 (+ (* 3 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0))) (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; {491#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* 3 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0)))) unseeded))} is VALID [2020-07-29 01:28:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:42,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:42,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:42,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,488 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2020-07-29 01:28:42,488 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 01:28:42,527 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 9 states and 11 transitions. Complement of second has 4 states. [2020-07-29 01:28:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:42,528 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:42,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:42,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:42,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:42,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:42,530 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:42,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:42,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:28:42,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:42,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:42,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:42,531 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:42,531 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:42,531 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:42,532 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:42,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 3 transitions. cyclomatic complexity: 1 [2020-07-29 01:28:42,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:42,532 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:42,533 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:42,533 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:42,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:42,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:42,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:42,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:42,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:42,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:42,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:42,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:42,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:42,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,540 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2020-07-29 01:28:42,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,541 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:42,700 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {463#unseeded} is VALID [2020-07-29 01:28:42,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#unseeded} assume main_~k~0 >= 1;main_~i~0 := 0; {540#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {540#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {540#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {540#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; {540#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {540#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !(main_~j~0 <= main_~i~0); {540#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,705 INFO L280 TraceCheckUtils]: 5: Hoare triple {540#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} main_~i~0 := 1 + main_~i~0; {488#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:42,706 INFO L280 TraceCheckUtils]: 6: Hoare triple {488#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {488#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,710 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:42,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {489#(and (>= oldRank0 (+ (* 3 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0))) (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; {491#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* 3 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0)))) unseeded))} is VALID [2020-07-29 01:28:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:42,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:42,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:42,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 1 loop predicates [2020-07-29 01:28:42,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 01:28:42,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 9 states and 11 transitions. Complement of second has 4 states. [2020-07-29 01:28:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:42,766 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:42,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:42,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:42,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:42,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:42,767 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:42,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:42,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:28:42,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:42,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:42,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:42,768 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:42,768 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:42,769 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:42,769 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:42,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 3 transitions. cyclomatic complexity: 1 [2020-07-29 01:28:42,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:42,769 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:42,769 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:42,770 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:42,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:42,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:42,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:42,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:42,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:42,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:42,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:42,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:42,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:42,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,775 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2020-07-29 01:28:42,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,775 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:42,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {463#unseeded} is VALID [2020-07-29 01:28:42,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#unseeded} assume main_~k~0 >= 1;main_~i~0 := 0; {580#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,885 INFO L280 TraceCheckUtils]: 2: Hoare triple {580#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {580#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,886 INFO L280 TraceCheckUtils]: 3: Hoare triple {580#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; {580#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,886 INFO L280 TraceCheckUtils]: 4: Hoare triple {580#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !(main_~j~0 <= main_~i~0); {580#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 01:28:42,887 INFO L280 TraceCheckUtils]: 5: Hoare triple {580#(and (<= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~k~0) unseeded)} main_~i~0 := 1 + main_~i~0; {488#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:42,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {488#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {488#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:28:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,893 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:42,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {489#(and (>= oldRank0 (+ (* 3 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0))) (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; {491#(and (>= (+ ULTIMATE.start_main_~k~0 (- 1)) 0) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* 3 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0)))) unseeded))} is VALID [2020-07-29 01:28:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:42,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:42,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:42,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:42,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:42,913 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2020-07-29 01:28:42,914 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 01:28:43,022 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 7 states. [2020-07-29 01:28:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 1 non-accepting loop states 2 accepting loop states [2020-07-29 01:28:43,023 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:43,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:43,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:43,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:43,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:43,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:43,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:43,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:43,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2020-07-29 01:28:43,025 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:43,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:43,025 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:43,025 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:43,025 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:43,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:43,026 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:43,027 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:43,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:43,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:43,027 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:43,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:43,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:43,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:43,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:43,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:43,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:43,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:43,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:43,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:43,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:43,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:43,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:43,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:43,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:43,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:43,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:43,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:43,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:43,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:43,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:43,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:43,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,032 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2020-07-29 01:28:43,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:43,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:28:43,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:43,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:43,035 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:43,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2020-07-29 01:28:43,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:43,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:43,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:43,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:43,036 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:43,036 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:43,036 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:43,036 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:43,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:43,036 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:43,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:43,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:43 BoogieIcfgContainer [2020-07-29 01:28:43,044 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:43,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:43,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:43,045 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:43,045 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:35" (3/4) ... [2020-07-29 01:28:43,049 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:43,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:43,053 INFO L168 Benchmark]: Toolchain (without parser) took 8220.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 961.6 MB in the beginning and 1.2 GB in the end (delta: -256.1 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:43,053 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:43,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.23 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:43,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:43,055 INFO L168 Benchmark]: Boogie Preprocessor took 24.53 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:43,056 INFO L168 Benchmark]: RCFGBuilder took 282.33 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:43,057 INFO L168 Benchmark]: BuchiAutomizer took 7540.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.3 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:43,057 INFO L168 Benchmark]: Witness Printer took 5.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:43,061 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.23 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 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 101.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.53 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 282.33 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7540.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.3 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * i + n and consists of 3 locations. One deterministic module has affine ranking function k + -2 * j and consists of 4 locations. One nondeterministic module has affine ranking function 3 * i + -2 * j and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 21 SDtfs, 42 SDslu, 9 SDs, 0 SdLazy, 81 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax156 hnf96 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf92 smp100 dnf100 smp100 tf103 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...