./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.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/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.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 c0afa1d46bded0eb2bd485bf4790c0d11468ed7a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:53,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:53,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:53,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:53,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:53,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:53,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:53,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:53,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:53,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:53,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:53,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:53,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:53,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:53,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:53,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:53,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:53,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:53,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:53,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:53,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:53,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:53,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:53,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:53,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:53,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:53,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:53,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:53,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:53,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:53,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:53,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:53,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:53,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:53,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:53,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:53,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:53,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:53,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:53,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:53,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:53,445 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:53,483 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:53,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:53,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:53,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:53,487 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:53,488 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:53,488 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:53,488 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:53,489 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:53,489 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:53,490 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:53,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:53,491 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:53,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:53,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:53,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:53,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:53,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:53,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:53,494 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:53,495 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:53,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:53,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:53,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:53,496 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:53,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:53,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:53,497 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:53,497 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:53,498 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:53,499 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 -> c0afa1d46bded0eb2bd485bf4790c0d11468ed7a [2020-07-29 01:28:53,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:53,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:53,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:53,822 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:53,823 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:53,824 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2020-07-29 01:28:53,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa7b86c3/4679f2c7f7fe4f0696b052a6a7472a9f/FLAGbde053a6f [2020-07-29 01:28:54,286 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:54,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2020-07-29 01:28:54,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa7b86c3/4679f2c7f7fe4f0696b052a6a7472a9f/FLAGbde053a6f [2020-07-29 01:28:54,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa7b86c3/4679f2c7f7fe4f0696b052a6a7472a9f [2020-07-29 01:28:54,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:54,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:54,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:54,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:54,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:54,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:54" (1/1) ... [2020-07-29 01:28:54,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596bcb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:54, skipping insertion in model container [2020-07-29 01:28:54,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:54" (1/1) ... [2020-07-29 01:28:54,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:54,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:54,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:54,909 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:54,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:54,942 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:54,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:54 WrapperNode [2020-07-29 01:28:54,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:54,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:54,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:54,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:54,953 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:54" (1/1) ... [2020-07-29 01:28:54,959 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:54" (1/1) ... [2020-07-29 01:28:55,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:55,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:55,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:55,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:55,050 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:54" (1/1) ... [2020-07-29 01:28:55,050 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:54" (1/1) ... [2020-07-29 01:28:55,051 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:54" (1/1) ... [2020-07-29 01:28:55,051 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:54" (1/1) ... [2020-07-29 01:28:55,055 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:54" (1/1) ... [2020-07-29 01:28:55,061 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:54" (1/1) ... [2020-07-29 01:28:55,062 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:54" (1/1) ... [2020-07-29 01:28:55,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:55,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:55,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:55,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:55,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:55,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:55,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:55,320 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:55,320 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:28:55,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:55 BoogieIcfgContainer [2020-07-29 01:28:55,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:55,325 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:55,325 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:55,329 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:55,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:55,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:54" (1/3) ... [2020-07-29 01:28:55,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fd6684a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:55, skipping insertion in model container [2020-07-29 01:28:55,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:55,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:54" (2/3) ... [2020-07-29 01:28:55,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fd6684a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:55, skipping insertion in model container [2020-07-29 01:28:55,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:55,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:55" (3/3) ... [2020-07-29 01:28:55,335 INFO L371 chiAutomizerObserver]: Analyzing ICFG LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2020-07-29 01:28:55,417 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:55,418 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:55,418 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:55,418 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:55,418 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:55,418 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:55,419 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:55,419 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:55,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:28:55,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:55,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:55,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:55,468 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:55,468 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:55,469 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:55,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:28:55,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:55,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:55,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:55,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:55,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:55,480 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 4#L21true assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 10#L22-2true [2020-07-29 01:28:55,481 INFO L796 eck$LassoCheckResult]: Loop: 10#L22-2true assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 7#L24-2true assume !(main_~y~0 < main_~z~0); 5#L24-3true main_~y~0 := main_~x~0 + main_~y~0; 10#L22-2true [2020-07-29 01:28:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:55,487 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2020-07-29 01:28:55,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:55,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916011601] [2020-07-29 01:28:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,564 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,584 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:55,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash 42930, now seen corresponding path program 1 times [2020-07-29 01:28:55,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:55,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728447121] [2020-07-29 01:28:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash 29684975, now seen corresponding path program 1 times [2020-07-29 01:28:55,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:55,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442600185] [2020-07-29 01:28:55,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,630 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:55,716 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:55,717 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:55,717 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:55,717 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:55,718 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:55,718 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:55,718 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:55,718 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:55,718 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration1_Loop [2020-07-29 01:28:55,718 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:55,719 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:55,760 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:55,774 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:55,781 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:55,932 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:55,933 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:55,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:55,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:55,954 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:55,954 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:56,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:56,013 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:56,013 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:56,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:56,061 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:56,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:56,109 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:56,314 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:56,316 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:56,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:56,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:56,317 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:56,317 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:56,317 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,317 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:56,317 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:56,318 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration1_Loop [2020-07-29 01:28:56,318 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:56,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:56,329 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:56,335 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:56,341 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:56,477 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:56,483 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,490 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:56,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:56,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:56,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:56,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:56,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:56,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:56,505 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,541 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:56,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:56,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:56,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:56,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:56,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:56,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:56,552 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,579 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:56,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:56,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:56,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:56,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:56,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:56,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:56,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:56,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:28:56,615 INFO L489 LassoAnalysis]: Using template '2-nested'. 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:56,632 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:56,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:56,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:56,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:56,635 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:56,640 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:28:56,640 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,646 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:56,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:56,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:56,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:56,684 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:56,689 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:28:56,689 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:28:56,697 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 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:56,734 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:56,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:56,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:56,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:56,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:56,737 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:56,740 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:28:56,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:56,745 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:56,756 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:56,756 INFO L444 ModelExtractionUtils]: 5 out of 9 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:56,770 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:56,771 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:56,771 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:56,772 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,815 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:56,821 INFO L393 LassoCheck]: Loop: "assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1;" "assume !(main_~y~0 < main_~z~0);" "main_~y~0 := main_~x~0 + main_~y~0;" [2020-07-29 01:28:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:56,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:56,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:56,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {19#unseeded} is VALID [2020-07-29 01:28:56,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {19#unseeded} is VALID [2020-07-29 01:28:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:56,910 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:56,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:57,000 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:28:57,022 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:28:57,068 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:28:57,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#(and (>= oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0)))} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {41#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:28:57,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} assume !(main_~y~0 < main_~z~0); {41#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:28:57,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} main_~y~0 := main_~x~0 + main_~y~0; {33#(or (and (>= oldRank0 0) (> oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0))) (and (>= oldRank1 0) (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0)) (> oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))) unseeded)} is VALID [2020-07-29 01:28:57,140 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:57,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:57,170 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:57,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:57,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,183 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:57,184 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 3 states. [2020-07-29 01:28:57,304 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 3 states. Result 34 states and 47 transitions. Complement of second has 8 states. [2020-07-29 01:28:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:57,304 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:57,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:28:57,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:57,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:57,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:57,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:57,310 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:57,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:57,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:57,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 47 transitions. [2020-07-29 01:28:57,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:57,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:57,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:57,316 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:28:57,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:57,318 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:57,318 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:57,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:57,322 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:57,322 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 47 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:57,323 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:57,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:57,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:57,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:57,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:28:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:28:57,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:28:57,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:57,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:57,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:57,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:57,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:57,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:57,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:57,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:57,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:57,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:57,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:57,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:57,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:57,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:57,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:57,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:57,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:57,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:57,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:57,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:57,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:57,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:57,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:57,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:57,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:57,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:57,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,342 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 01:28:57,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:57,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:57,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:28:57,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:57,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:57,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:57,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 10 states and 14 transitions. [2020-07-29 01:28:57,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:28:57,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:28:57,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2020-07-29 01:28:57,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:57,361 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-07-29 01:28:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2020-07-29 01:28:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:28:57,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:57,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 14 transitions. Second operand 10 states. [2020-07-29 01:28:57,389 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 14 transitions. Second operand 10 states. [2020-07-29 01:28:57,391 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 10 states. [2020-07-29 01:28:57,395 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:57,397 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-07-29 01:28:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:28:57,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:57,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:57,399 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 14 transitions. [2020-07-29 01:28:57,399 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 14 transitions. [2020-07-29 01:28:57,400 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:57,402 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-07-29 01:28:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:28:57,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:57,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:57,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:57,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:28:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2020-07-29 01:28:57,405 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-07-29 01:28:57,405 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-07-29 01:28:57,406 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:57,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:28:57,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:57,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:57,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:57,407 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:28:57,407 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:57,408 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 93#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 94#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 100#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 101#L24-2 [2020-07-29 01:28:57,408 INFO L796 eck$LassoCheckResult]: Loop: 101#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 101#L24-2 [2020-07-29 01:28:57,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2020-07-29 01:28:57,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:57,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615987589] [2020-07-29 01:28:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:57,429 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2020-07-29 01:28:57,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:57,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094212403] [2020-07-29 01:28:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:57,439 INFO L82 PathProgramCache]: Analyzing trace with hash 29685033, now seen corresponding path program 2 times [2020-07-29 01:28:57,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:57,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224042535] [2020-07-29 01:28:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:57,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:57,465 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:57,490 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:57,491 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:57,491 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:57,491 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:57,491 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:57,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:57,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:57,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration2_Loop [2020-07-29 01:28:57,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:57,494 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:57,508 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:57,513 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:57,520 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:57,533 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:57,659 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:57,659 INFO L404 LassoAnalysis]: Checking for nontermination... 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:57,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:57,671 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:57,676 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:57,676 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:57,724 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,727 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:57,728 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:57,775 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:57,831 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:58,097 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:58,099 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:58,099 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:58,099 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:58,099 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:58,100 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:58,100 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:58,100 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:58,100 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:58,100 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration2_Loop [2020-07-29 01:28:58,100 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:58,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:58,110 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:58,115 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:58,123 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:58,131 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:58,249 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:58,249 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:58,253 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:58,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:58,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:58,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:58,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:58,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:58,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:58,264 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 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:58,289 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:58,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:58,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:58,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:58,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:58,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:58,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:58,302 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 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:58,379 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:58,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:58,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:58,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:58,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:58,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:58,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:58,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:58,397 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:58,403 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:58,403 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:58,414 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:58,414 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:58,414 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:58,414 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2020-07-29 01:28:58,437 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:58,440 INFO L393 LassoCheck]: Loop: "assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1;" [2020-07-29 01:28:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:58,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {160#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {160#unseeded} is VALID [2020-07-29 01:28:58,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {160#unseeded} is VALID [2020-07-29 01:28:58,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {160#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {160#unseeded} is VALID [2020-07-29 01:28:58,478 INFO L280 TraceCheckUtils]: 3: Hoare triple {160#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {160#unseeded} is VALID [2020-07-29 01:28:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,482 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:58,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {163#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~z~0))} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {173#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~z~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:58,486 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:58,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:58,490 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:58,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:58,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,491 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:58,491 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand 2 states. [2020-07-29 01:28:58,521 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 6. Second operand 2 states. Result 17 states and 28 transitions. Complement of second has 6 states. [2020-07-29 01:28:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:58,521 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:58,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:58,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:58,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:28:58,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 28 transitions. [2020-07-29 01:28:58,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:58,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,525 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 14 transitions. cyclomatic complexity: 6 [2020-07-29 01:28:58,525 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:58,525 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:58,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:28:58,527 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:58,527 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 28 transitions. cyclomatic complexity: 15 [2020-07-29 01:28:58,528 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:58,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:58,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:58,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:58,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:58,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:58,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:58,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:58,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:58,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:58,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:58,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:58,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:58,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:58,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:58,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:58,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:58,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:58,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:58,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:58,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:58,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:58,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:58,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:58,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:58,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:58,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:58,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:58,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:58,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:58,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:58,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:58,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:58,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:58,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 28 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,540 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:28:58,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:58,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:28:58,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:58,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 28 transitions. cyclomatic complexity: 15 [2020-07-29 01:28:58,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:58,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 19 transitions. [2020-07-29 01:28:58,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:28:58,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:28:58,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2020-07-29 01:28:58,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:58,546 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:28:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2020-07-29 01:28:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 01:28:58,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:58,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 19 transitions. Second operand 12 states. [2020-07-29 01:28:58,547 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 19 transitions. Second operand 12 states. [2020-07-29 01:28:58,548 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 12 states. [2020-07-29 01:28:58,548 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:58,549 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-29 01:28:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:28:58,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:58,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:58,550 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 19 transitions. [2020-07-29 01:28:58,550 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 19 transitions. [2020-07-29 01:28:58,550 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:58,552 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-29 01:28:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:28:58,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:58,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:58,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:58,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:28:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2020-07-29 01:28:58,555 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-07-29 01:28:58,555 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-07-29 01:28:58,555 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:58,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2020-07-29 01:28:58,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:58,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,557 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:28:58,557 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:58,557 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 216#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 217#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 221#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 223#L24-2 assume !(main_~y~0 < main_~z~0); 212#L24-3 [2020-07-29 01:28:58,557 INFO L796 eck$LassoCheckResult]: Loop: 212#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 213#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 219#L24-2 assume !(main_~y~0 < main_~z~0); 212#L24-3 [2020-07-29 01:28:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:58,557 INFO L82 PathProgramCache]: Analyzing trace with hash 29685031, now seen corresponding path program 1 times [2020-07-29 01:28:58,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:58,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686975470] [2020-07-29 01:28:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash 55200, now seen corresponding path program 2 times [2020-07-29 01:28:58,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:58,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128411408] [2020-07-29 01:28:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:58,583 INFO L82 PathProgramCache]: Analyzing trace with hash -416479046, now seen corresponding path program 1 times [2020-07-29 01:28:58,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:58,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748461565] [2020-07-29 01:28:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:58,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:58,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:58,626 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:58,626 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:58,626 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:58,626 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:58,627 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:58,627 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:58,627 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:58,627 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:58,627 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration3_Loop [2020-07-29 01:28:58,627 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:58,627 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:58,634 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:58,641 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:58,652 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:58,763 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:58,763 INFO L404 LassoAnalysis]: Checking for nontermination... 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:58,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:58,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:58,775 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:58,775 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 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:58,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:58,801 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:58,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:58,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:59,032 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:59,034 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:59,034 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:59,034 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:59,034 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:59,034 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:59,035 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,035 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:59,035 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:59,035 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration3_Loop [2020-07-29 01:28:59,035 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:59,035 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:59,046 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:59,057 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:59,061 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:59,161 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:59,162 INFO L489 LassoAnalysis]: Using template 'affine'. 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:59,165 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:59,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:59,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:59,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:59,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:59,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:59,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:59,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:59,170 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 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:59,192 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:59,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:59,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:59,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:59,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:59,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:59,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:59,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,221 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:59,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:59,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:59,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:59,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:59,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:59,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:59,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:28:59,248 INFO L489 LassoAnalysis]: Using template '2-nested'. 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:59,251 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:59,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:59,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:59,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:59,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:59,253 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:59,255 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:28:59,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:59,264 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:59,271 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:59,271 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 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) [2020-07-29 01:28:59,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:59,274 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:59,274 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:59,274 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,296 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:59,298 INFO L393 LassoCheck]: Loop: "main_~y~0 := main_~x~0 + main_~y~0;" "assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1;" "assume !(main_~y~0 < main_~z~0);" [2020-07-29 01:28:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:59,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:59,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:59,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:59,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {292#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {292#unseeded} is VALID [2020-07-29 01:28:59,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {292#unseeded} is VALID [2020-07-29 01:28:59,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {292#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {292#unseeded} is VALID [2020-07-29 01:28:59,344 INFO L280 TraceCheckUtils]: 3: Hoare triple {292#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {292#unseeded} is VALID [2020-07-29 01:28:59,344 INFO L280 TraceCheckUtils]: 4: Hoare triple {292#unseeded} assume !(main_~y~0 < main_~z~0); {292#unseeded} is VALID [2020-07-29 01:28:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:59,349 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:59,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:59,381 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:28:59,506 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:28:59,521 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:28:59,577 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:28:59,656 INFO L280 TraceCheckUtils]: 0: Hoare triple {297#(and (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0)) (>= oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0))))} main_~y~0 := main_~x~0 + main_~y~0; {323#(and (or (and (<= ULTIMATE.start_main_~x~0 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= ULTIMATE.start_main_~x~0 oldRank1) (< 0 ULTIMATE.start_main_~x~0))) (or (and (<= 0 oldRank0) (<= ULTIMATE.start_main_~x~0 0)) (<= 1 oldRank0)))} is VALID [2020-07-29 01:28:59,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#(and (or (and (<= ULTIMATE.start_main_~x~0 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= ULTIMATE.start_main_~x~0 oldRank1) (< 0 ULTIMATE.start_main_~x~0))) (or (and (<= 0 oldRank0) (<= ULTIMATE.start_main_~x~0 0)) (<= 1 oldRank0)))} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {327#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:28:59,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {327#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} assume !(main_~y~0 < main_~z~0); {306#(or (and (>= oldRank0 0) (> oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0))) (and (>= oldRank1 0) (> oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0))) (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0))) unseeded)} is VALID [2020-07-29 01:28:59,660 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:59,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:59,672 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:59,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:59,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,673 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:59,673 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:28:59,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 30 states and 45 transitions. Complement of second has 8 states. [2020-07-29 01:28:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:59,736 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:59,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:59,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:59,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:59,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:59,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:28:59,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:59,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:59,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 45 transitions. [2020-07-29 01:28:59,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:59,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:59,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:59,743 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 18 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:59,745 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:59,746 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:59,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:28:59,748 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:59,748 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 45 transitions. cyclomatic complexity: 21 [2020-07-29 01:28:59,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:59,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:59,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:59,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:59,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:59,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:59,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:59,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:59,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:59,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:59,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:59,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:59,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:59,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:59,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:59,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:59,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:59,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:59,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:59,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:59,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:59,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:59,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:59,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:59,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:59,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:59,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:59,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:59,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:59,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:59,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:59,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:59,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:59,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:59,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:28:59,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:28:59,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:28:59,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:59,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:59,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:59,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:59,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:59,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 45 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:59,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,772 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-07-29 01:28:59,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:59,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:59,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:28:59,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:59,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. cyclomatic complexity: 21 [2020-07-29 01:28:59,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:59,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 33 transitions. [2020-07-29 01:28:59,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:28:59,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:28:59,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2020-07-29 01:28:59,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:59,783 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-07-29 01:28:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2020-07-29 01:28:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-07-29 01:28:59,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:59,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 33 transitions. Second operand 18 states. [2020-07-29 01:28:59,788 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 33 transitions. Second operand 18 states. [2020-07-29 01:28:59,788 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 18 states. [2020-07-29 01:28:59,788 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:59,798 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2020-07-29 01:28:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2020-07-29 01:28:59,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:59,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:59,799 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 22 states and 33 transitions. [2020-07-29 01:28:59,799 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 22 states and 33 transitions. [2020-07-29 01:28:59,799 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:59,805 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2020-07-29 01:28:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2020-07-29 01:28:59,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:59,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:59,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:59,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:28:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-07-29 01:28:59,808 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 01:28:59,808 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 01:28:59,808 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:59,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2020-07-29 01:28:59,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:59,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:59,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:59,816 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 01:28:59,816 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:59,816 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 375#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 376#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 388#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 387#L24-2 assume !(main_~y~0 < main_~z~0); 372#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 373#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 384#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 383#L24-2 [2020-07-29 01:28:59,817 INFO L796 eck$LassoCheckResult]: Loop: 383#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 383#L24-2 [2020-07-29 01:28:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash -416479044, now seen corresponding path program 2 times [2020-07-29 01:28:59,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:59,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90530931] [2020-07-29 01:28:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:59,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:59,850 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2020-07-29 01:28:59,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:59,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612606368] [2020-07-29 01:28:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash -25948454, now seen corresponding path program 3 times [2020-07-29 01:28:59,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:59,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797139533] [2020-07-29 01:28:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,883 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:59,901 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:59,901 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:59,901 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:59,902 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:59,902 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:59,902 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,902 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:59,902 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:59,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration4_Loop [2020-07-29 01:28:59,903 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:59,903 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:59,909 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:59,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:59,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:59,925 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:29:00,022 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:00,022 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) [2020-07-29 01:29:00,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:00,028 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,033 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:00,033 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} 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:29:00,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:00,057 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:00,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:00,264 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:00,265 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:00,265 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:00,265 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:00,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:00,266 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:00,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:00,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:00,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration4_Loop [2020-07-29 01:29:00,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:00,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:00,271 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:29:00,278 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:29:00,284 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:29:00,288 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:29:00,397 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:00,397 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,404 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:29:00,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:00,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:00,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:00,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:00,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:00,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:00,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:00,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:00,415 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:29:00,415 INFO L444 ModelExtractionUtils]: 0 out of 4 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:00,418 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:00,418 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:00,418 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:00,418 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~z~0 - 1*ULTIMATE.start_main_~y~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,442 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:00,445 INFO L393 LassoCheck]: Loop: "assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1;" [2020-07-29 01:29:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:00,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {490#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {490#unseeded} is VALID [2020-07-29 01:29:00,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {490#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {490#unseeded} is VALID [2020-07-29 01:29:00,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {490#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,490 INFO L280 TraceCheckUtils]: 3: Hoare triple {490#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,490 INFO L280 TraceCheckUtils]: 4: Hoare triple {490#unseeded} assume !(main_~y~0 < main_~z~0); {490#unseeded} is VALID [2020-07-29 01:29:00,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#unseeded} main_~y~0 := main_~x~0 + main_~y~0; {490#unseeded} is VALID [2020-07-29 01:29:00,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {490#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,492 INFO L280 TraceCheckUtils]: 7: Hoare triple {490#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,495 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:00,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {493#(>= oldRank0 (+ ULTIMATE.start_main_~z~0 (* (- 1) ULTIMATE.start_main_~y~0)))} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {503#(or (and (> oldRank0 (+ ULTIMATE.start_main_~z~0 (* (- 1) ULTIMATE.start_main_~y~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:00,503 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:29:00,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:00,508 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:29:00,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:00,509 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2020-07-29 01:29:00,532 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 21 states and 30 transitions. Complement of second has 5 states. [2020-07-29 01:29:00,533 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:29:00,533 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:00,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 01:29:00,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:00,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:00,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-07-29 01:29:00,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:00,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,536 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 01:29:00,536 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:00,536 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:00,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:00,537 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:00,538 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:00,541 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:00,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:29:00,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:29:00,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:29:00,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:00,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:00,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:00,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:00,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:00,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:00,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,555 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:29:00,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,556 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:00,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {490#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {490#unseeded} is VALID [2020-07-29 01:29:00,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {490#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {490#unseeded} is VALID [2020-07-29 01:29:00,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {490#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,591 INFO L280 TraceCheckUtils]: 3: Hoare triple {490#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,591 INFO L280 TraceCheckUtils]: 4: Hoare triple {490#unseeded} assume !(main_~y~0 < main_~z~0); {490#unseeded} is VALID [2020-07-29 01:29:00,592 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#unseeded} main_~y~0 := main_~x~0 + main_~y~0; {490#unseeded} is VALID [2020-07-29 01:29:00,592 INFO L280 TraceCheckUtils]: 6: Hoare triple {490#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,593 INFO L280 TraceCheckUtils]: 7: Hoare triple {490#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,598 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:00,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {493#(>= oldRank0 (+ ULTIMATE.start_main_~z~0 (* (- 1) ULTIMATE.start_main_~y~0)))} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {503#(or (and (> oldRank0 (+ ULTIMATE.start_main_~z~0 (* (- 1) ULTIMATE.start_main_~y~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:00,603 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:29:00,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:00,609 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:29:00,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:00,609 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2020-07-29 01:29:00,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 21 states and 30 transitions. Complement of second has 5 states. [2020-07-29 01:29:00,636 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:29:00,636 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:00,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 01:29:00,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:00,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:00,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-07-29 01:29:00,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:00,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,640 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 01:29:00,640 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:00,640 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:00,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:00,641 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:00,641 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:00,642 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:00,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:29:00,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:29:00,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:29:00,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:00,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:00,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:00,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:00,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:00,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:00,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,655 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:29:00,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,656 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:00,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {490#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {490#unseeded} is VALID [2020-07-29 01:29:00,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {490#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {490#unseeded} is VALID [2020-07-29 01:29:00,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {490#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,692 INFO L280 TraceCheckUtils]: 3: Hoare triple {490#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,692 INFO L280 TraceCheckUtils]: 4: Hoare triple {490#unseeded} assume !(main_~y~0 < main_~z~0); {490#unseeded} is VALID [2020-07-29 01:29:00,693 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#unseeded} main_~y~0 := main_~x~0 + main_~y~0; {490#unseeded} is VALID [2020-07-29 01:29:00,694 INFO L280 TraceCheckUtils]: 6: Hoare triple {490#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,694 INFO L280 TraceCheckUtils]: 7: Hoare triple {490#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {490#unseeded} is VALID [2020-07-29 01:29:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,697 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:00,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {493#(>= oldRank0 (+ ULTIMATE.start_main_~z~0 (* (- 1) ULTIMATE.start_main_~y~0)))} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {503#(or (and (> oldRank0 (+ ULTIMATE.start_main_~z~0 (* (- 1) ULTIMATE.start_main_~y~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:00,702 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:29:00,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:00,707 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:29:00,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,708 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:00,708 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2020-07-29 01:29:00,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 29 states and 45 transitions. Complement of second has 5 states. [2020-07-29 01:29:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:00,739 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:00,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 01:29:00,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:29:00,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:00,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 45 transitions. [2020-07-29 01:29:00,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:29:00,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,743 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 01:29:00,743 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:00,743 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:29:00,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:00,744 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:00,744 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 45 transitions. cyclomatic complexity: 22 [2020-07-29 01:29:00,745 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:00,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:00,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:00,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:00,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:29:00,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:29:00,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:29:00,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:00,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:00,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:00,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:00,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:00,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:00,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:00,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:00,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:00,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:00,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:00,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:00,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:00,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:00,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:00,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 45 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:00,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,760 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:29:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:29:00,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:29:00,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:29:00,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:00,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 45 transitions. cyclomatic complexity: 22 [2020-07-29 01:29:00,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:29:00,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2020-07-29 01:29:00,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:29:00,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:29:00,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-07-29 01:29:00,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:00,766 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-07-29 01:29:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-07-29 01:29:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-07-29 01:29:00,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:00,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 31 transitions. Second operand 18 states. [2020-07-29 01:29:00,768 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 31 transitions. Second operand 18 states. [2020-07-29 01:29:00,768 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 18 states. [2020-07-29 01:29:00,769 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:00,770 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2020-07-29 01:29:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:29:00,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:00,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:00,771 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 22 states and 31 transitions. [2020-07-29 01:29:00,771 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 22 states and 31 transitions. [2020-07-29 01:29:00,772 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:00,774 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2020-07-29 01:29:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:29:00,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:00,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:00,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:00,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:29:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-07-29 01:29:00,776 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 01:29:00,776 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 01:29:00,776 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:29:00,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2020-07-29 01:29:00,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:00,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 01:29:00,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:00,778 INFO L794 eck$LassoCheckResult]: Stem: 677#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 675#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 676#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 680#L24-2 assume !(main_~y~0 < main_~z~0); 673#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 674#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 678#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 679#L24-2 assume !(main_~y~0 < main_~z~0); 671#L24-3 [2020-07-29 01:29:00,778 INFO L796 eck$LassoCheckResult]: Loop: 671#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 672#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 683#L24-2 assume !(main_~y~0 < main_~z~0); 671#L24-3 [2020-07-29 01:29:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,778 INFO L82 PathProgramCache]: Analyzing trace with hash -418159556, now seen corresponding path program 4 times [2020-07-29 01:29:00,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:00,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310701594] [2020-07-29 01:29:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:00,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:00,794 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:00,796 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:00,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,797 INFO L82 PathProgramCache]: Analyzing trace with hash 55200, now seen corresponding path program 3 times [2020-07-29 01:29:00,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:00,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109148787] [2020-07-29 01:29:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:00,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:00,804 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:00,805 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1986148987, now seen corresponding path program 5 times [2020-07-29 01:29:00,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:00,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237960607] [2020-07-29 01:29:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {790#true} is VALID [2020-07-29 01:29:00,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {790#true} is VALID [2020-07-29 01:29:00,917 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#true} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {790#true} is VALID [2020-07-29 01:29:00,918 INFO L280 TraceCheckUtils]: 3: Hoare triple {790#true} assume !(main_~y~0 < main_~z~0); {792#(<= ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:00,919 INFO L280 TraceCheckUtils]: 4: Hoare triple {792#(<= ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~y~0)} main_~y~0 := main_~x~0 + main_~y~0; {793#(<= (+ ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:00,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {793#(<= (+ ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~y~0)} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {794#(<= (+ ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:00,920 INFO L280 TraceCheckUtils]: 6: Hoare triple {794#(<= (+ ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~y~0)} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {795#(<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} is VALID [2020-07-29 01:29:00,924 INFO L280 TraceCheckUtils]: 7: Hoare triple {795#(<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} assume !(main_~y~0 < main_~z~0); {795#(<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} is VALID [2020-07-29 01:29:00,925 INFO L280 TraceCheckUtils]: 8: Hoare triple {795#(<= (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} main_~y~0 := main_~x~0 + main_~y~0; {796#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} is VALID [2020-07-29 01:29:00,925 INFO L280 TraceCheckUtils]: 9: Hoare triple {796#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {796#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} is VALID [2020-07-29 01:29:00,926 INFO L280 TraceCheckUtils]: 10: Hoare triple {796#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} assume !(main_~y~0 < main_~z~0); {791#false} is VALID [2020-07-29 01:29:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:00,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237960607] [2020-07-29 01:29:00,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56221010] [2020-07-29 01:29:00,929 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:29:00,957 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-07-29 01:29:00,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:00,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:01,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {790#true} is VALID [2020-07-29 01:29:01,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#true} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {790#true} is VALID [2020-07-29 01:29:01,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#true} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {790#true} is VALID [2020-07-29 01:29:01,272 INFO L280 TraceCheckUtils]: 3: Hoare triple {790#true} assume !(main_~y~0 < main_~z~0); {792#(<= ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:01,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {792#(<= ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~y~0)} main_~y~0 := main_~x~0 + main_~y~0; {793#(<= (+ ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:01,276 INFO L280 TraceCheckUtils]: 5: Hoare triple {793#(<= (+ ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~y~0)} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {794#(<= (+ ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:01,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {794#(<= (+ ULTIMATE.start_main_~z~0 ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~y~0)} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {818#(and (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~z~0) (<= (+ ULTIMATE.start_main_~x~0 1) 0))} is VALID [2020-07-29 01:29:01,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {818#(and (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~z~0) (<= (+ ULTIMATE.start_main_~x~0 1) 0))} assume !(main_~y~0 < main_~z~0); {818#(and (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~z~0) (<= (+ ULTIMATE.start_main_~x~0 1) 0))} is VALID [2020-07-29 01:29:01,279 INFO L280 TraceCheckUtils]: 8: Hoare triple {818#(and (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~z~0) (<= (+ ULTIMATE.start_main_~x~0 1) 0))} main_~y~0 := main_~x~0 + main_~y~0; {796#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} is VALID [2020-07-29 01:29:01,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {796#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {796#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} is VALID [2020-07-29 01:29:01,281 INFO L280 TraceCheckUtils]: 10: Hoare triple {796#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~z~0)} assume !(main_~y~0 < main_~z~0); {791#false} is VALID [2020-07-29 01:29:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:01,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:01,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:29:01,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071610969] [2020-07-29 01:29:01,306 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:01,306 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:01,306 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:01,306 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:01,306 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:01,306 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,307 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:01,307 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:01,307 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration5_Loop [2020-07-29 01:29:01,307 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:01,307 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:01,313 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:29:01,317 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:29:01,321 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:29:01,418 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:01,418 INFO L404 LassoAnalysis]: Checking for nontermination... 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:29:01,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:01,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:01,424 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:01,424 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:29:01,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:01,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:01,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:01,449 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:29:01,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:01,472 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:29:01,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:01,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:01,684 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:01,686 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:01,686 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:01,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:01,686 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:01,687 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:01,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:01,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:01,687 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration5_Loop [2020-07-29 01:29:01,687 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:01,687 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:01,694 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:29:01,698 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:29:01,702 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:29:01,790 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:01,790 INFO L489 LassoAnalysis]: Using template 'affine'. 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:29:01,799 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:29:01,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:01,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:01,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,808 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,839 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:29:01,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:01,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:01,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:01,845 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,886 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:29:01,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:01,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:01,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:01,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:01,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:29:01,911 INFO L489 LassoAnalysis]: Using template '2-nested'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,913 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:29:01,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,915 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:01,917 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:29:01,917 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:29:01,921 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,944 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:29:01,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,946 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:01,949 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:29:01,949 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:29:01,953 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,975 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:29:01,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:01,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,977 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:01,978 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:01,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:01,982 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:01,990 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:29:01,990 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,992 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:01,993 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:01,993 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:01,993 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-07-29 01:29:02,016 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:02,018 INFO L393 LassoCheck]: Loop: "main_~y~0 := main_~x~0 + main_~y~0;" "assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1;" "assume !(main_~y~0 < main_~z~0);" [2020-07-29 01:29:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:02,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {828#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {828#unseeded} is VALID [2020-07-29 01:29:02,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {828#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {828#unseeded} is VALID [2020-07-29 01:29:02,069 INFO L280 TraceCheckUtils]: 2: Hoare triple {828#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {828#unseeded} is VALID [2020-07-29 01:29:02,069 INFO L280 TraceCheckUtils]: 3: Hoare triple {828#unseeded} assume !(main_~y~0 < main_~z~0); {828#unseeded} is VALID [2020-07-29 01:29:02,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {828#unseeded} main_~y~0 := main_~x~0 + main_~y~0; {828#unseeded} is VALID [2020-07-29 01:29:02,070 INFO L280 TraceCheckUtils]: 5: Hoare triple {828#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {828#unseeded} is VALID [2020-07-29 01:29:02,071 INFO L280 TraceCheckUtils]: 6: Hoare triple {828#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {828#unseeded} is VALID [2020-07-29 01:29:02,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {828#unseeded} assume !(main_~y~0 < main_~z~0); {828#unseeded} is VALID [2020-07-29 01:29:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,076 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:29:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:02,102 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:02,209 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:02,225 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:02,258 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:02,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {833#(and (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0)) (>= oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))))} main_~y~0 := main_~x~0 + main_~y~0; {868#(and (or (and (<= ULTIMATE.start_main_~x~0 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= ULTIMATE.start_main_~x~0 oldRank1) (< 0 ULTIMATE.start_main_~x~0))) (or (and (<= 0 oldRank0) (<= ULTIMATE.start_main_~x~0 0)) (<= 1 oldRank0)))} is VALID [2020-07-29 01:29:02,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {868#(and (or (and (<= ULTIMATE.start_main_~x~0 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= ULTIMATE.start_main_~x~0 oldRank1) (< 0 ULTIMATE.start_main_~x~0))) (or (and (<= 0 oldRank0) (<= ULTIMATE.start_main_~x~0 0)) (<= 1 oldRank0)))} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {872#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:29:02,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {872#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} assume !(main_~y~0 < main_~z~0); {842#(or (and (>= oldRank1 0) (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0)) (> oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)))) (and (>= oldRank0 0) (> oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0))) unseeded)} is VALID [2020-07-29 01:29:02,366 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:29:02,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:02,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:02,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,378 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:29:02,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-07-29 01:29:02,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 26 states and 37 transitions. Complement of second has 7 states. [2020-07-29 01:29:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:02,436 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:02,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:02,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:02,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:02,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:02,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:02,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:02,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:02,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2020-07-29 01:29:02,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:02,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:02,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:02,438 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 26 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:02,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:02,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:02,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:02,443 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:02,443 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 37 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:02,444 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:02,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:02,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:02,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:02,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:29:02,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:29:02,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:29:02,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:02,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:02,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:02,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:02,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:02,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:02,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 37 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,459 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-29 01:29:02,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,461 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:02,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {828#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {828#unseeded} is VALID [2020-07-29 01:29:02,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {828#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {828#unseeded} is VALID [2020-07-29 01:29:02,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {828#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {828#unseeded} is VALID [2020-07-29 01:29:02,496 INFO L280 TraceCheckUtils]: 3: Hoare triple {828#unseeded} assume !(main_~y~0 < main_~z~0); {828#unseeded} is VALID [2020-07-29 01:29:02,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {828#unseeded} main_~y~0 := main_~x~0 + main_~y~0; {828#unseeded} is VALID [2020-07-29 01:29:02,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {828#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {828#unseeded} is VALID [2020-07-29 01:29:02,498 INFO L280 TraceCheckUtils]: 6: Hoare triple {828#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {828#unseeded} is VALID [2020-07-29 01:29:02,499 INFO L280 TraceCheckUtils]: 7: Hoare triple {828#unseeded} assume !(main_~y~0 < main_~z~0); {828#unseeded} is VALID [2020-07-29 01:29:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,507 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:29:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:02,536 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:02,641 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:02,652 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:02,694 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:02,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {833#(and (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0)) (>= oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))))} main_~y~0 := main_~x~0 + main_~y~0; {937#(and (or (and (<= ULTIMATE.start_main_~x~0 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= ULTIMATE.start_main_~x~0 oldRank1) (< 0 ULTIMATE.start_main_~x~0))) (or (and (<= 0 oldRank0) (<= ULTIMATE.start_main_~x~0 0)) (<= 1 oldRank0)))} is VALID [2020-07-29 01:29:02,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {937#(and (or (and (<= ULTIMATE.start_main_~x~0 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= ULTIMATE.start_main_~x~0 oldRank1) (< 0 ULTIMATE.start_main_~x~0))) (or (and (<= 0 oldRank0) (<= ULTIMATE.start_main_~x~0 0)) (<= 1 oldRank0)))} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {941#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:29:02,783 INFO L280 TraceCheckUtils]: 2: Hoare triple {941#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} assume !(main_~y~0 < main_~z~0); {842#(or (and (>= oldRank1 0) (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0)) (> oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)))) (and (>= oldRank0 0) (> oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0))) unseeded)} is VALID [2020-07-29 01:29:02,783 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:29:02,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:02,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:02,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,794 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:29:02,795 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-07-29 01:29:02,842 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 24 states and 32 transitions. Complement of second has 7 states. [2020-07-29 01:29:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:02,843 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:02,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:02,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:02,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:02,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:02,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:02,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:02,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:02,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2020-07-29 01:29:02,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:02,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:02,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:02,846 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 26 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:02,846 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:02,846 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:02,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:02,847 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:02,847 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 32 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:02,847 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:02,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:02,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:02,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:02,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:02,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:02,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:02,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:02,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:02,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:02,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:02,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:02,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:02,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:02,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:02,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:02,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:02,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:02,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,858 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-07-29 01:29:02,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:02,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,859 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:02,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:02,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {828#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {828#unseeded} is VALID [2020-07-29 01:29:02,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {828#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {828#unseeded} is VALID [2020-07-29 01:29:02,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {828#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {828#unseeded} is VALID [2020-07-29 01:29:02,896 INFO L280 TraceCheckUtils]: 3: Hoare triple {828#unseeded} assume !(main_~y~0 < main_~z~0); {828#unseeded} is VALID [2020-07-29 01:29:02,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {828#unseeded} main_~y~0 := main_~x~0 + main_~y~0; {828#unseeded} is VALID [2020-07-29 01:29:02,897 INFO L280 TraceCheckUtils]: 5: Hoare triple {828#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {828#unseeded} is VALID [2020-07-29 01:29:02,898 INFO L280 TraceCheckUtils]: 6: Hoare triple {828#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {828#unseeded} is VALID [2020-07-29 01:29:02,899 INFO L280 TraceCheckUtils]: 7: Hoare triple {828#unseeded} assume !(main_~y~0 < main_~z~0); {828#unseeded} is VALID [2020-07-29 01:29:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,902 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:29:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:02,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:02,931 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:03,034 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:03,049 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:03,078 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:03,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {833#(and (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0)) (>= oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))))} main_~y~0 := main_~x~0 + main_~y~0; {1004#(and (or (and (<= ULTIMATE.start_main_~x~0 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= ULTIMATE.start_main_~x~0 oldRank1) (< 0 ULTIMATE.start_main_~x~0))) (or (and (<= 0 oldRank0) (<= ULTIMATE.start_main_~x~0 0)) (<= 1 oldRank0)))} is VALID [2020-07-29 01:29:03,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {1004#(and (or (and (<= ULTIMATE.start_main_~x~0 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= ULTIMATE.start_main_~x~0 oldRank1) (< 0 ULTIMATE.start_main_~x~0))) (or (and (<= 0 oldRank0) (<= ULTIMATE.start_main_~x~0 0)) (<= 1 oldRank0)))} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {1008#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:29:03,163 INFO L280 TraceCheckUtils]: 2: Hoare triple {1008#(and (or (and (<= 0 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 1) 0) (<= ULTIMATE.start_main_~y~0 oldRank1)) (and (<= 1 oldRank1) (<= (+ ULTIMATE.start_main_~x~0 1) oldRank1) (<= 1 oldRank0))) (<= 1 ULTIMATE.start_main_~y~0))} assume !(main_~y~0 < main_~z~0); {842#(or (and (>= oldRank1 0) (>= oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0)) (> oldRank1 (ite (> ULTIMATE.start_main_~x~0 0) ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)))) (and (>= oldRank0 0) (> oldRank0 (ite (> ULTIMATE.start_main_~x~0 0) 1 0))) unseeded)} is VALID [2020-07-29 01:29:03,163 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:29:03,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:03,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:03,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:03,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,172 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:29:03,173 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-07-29 01:29:03,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 31 states and 43 transitions. Complement of second has 6 states. [2020-07-29 01:29:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:03,226 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:03,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:03,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:03,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:03,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:03,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:03,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:03,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:03,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2020-07-29 01:29:03,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:29:03,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:03,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:03,229 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 26 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:03,229 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:03,229 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:03,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:03,229 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:03,230 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 43 transitions. cyclomatic complexity: 16 [2020-07-29 01:29:03,230 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:03,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:03,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:03,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:03,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:03,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:03,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:03,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:03,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:03,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:03,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:29:03,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:29:03,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:29:03,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:03,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:03,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:03,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:03,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:03,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:03,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:03,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:03,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:03,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:03,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:03,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:03,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:03,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:03,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:03,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:03,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:03,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:03,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:03,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:03,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:03,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:03,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:03,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:03,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,239 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:29:03,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:03,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:03,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:29:03,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:03,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 43 transitions. cyclomatic complexity: 16 [2020-07-29 01:29:03,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:29:03,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 24 states and 34 transitions. [2020-07-29 01:29:03,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:29:03,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:29:03,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2020-07-29 01:29:03,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:03,243 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-07-29 01:29:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2020-07-29 01:29:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2020-07-29 01:29:03,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:03,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 34 transitions. Second operand 19 states. [2020-07-29 01:29:03,245 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 34 transitions. Second operand 19 states. [2020-07-29 01:29:03,245 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 19 states. [2020-07-29 01:29:03,245 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:03,247 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2020-07-29 01:29:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2020-07-29 01:29:03,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:03,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:03,247 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 24 states and 34 transitions. [2020-07-29 01:29:03,247 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 24 states and 34 transitions. [2020-07-29 01:29:03,248 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:03,249 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2020-07-29 01:29:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2020-07-29 01:29:03,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:03,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:03,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:03,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:29:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2020-07-29 01:29:03,251 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2020-07-29 01:29:03,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:03,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:29:03,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:29:03,255 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand 8 states. [2020-07-29 01:29:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:03,507 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:29:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:29:03,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:29:03,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:03,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-07-29 01:29:03,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:03,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 28 transitions. [2020-07-29 01:29:03,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:29:03,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:29:03,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-07-29 01:29:03,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:03,530 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 01:29:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-07-29 01:29:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2020-07-29 01:29:03,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:03,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 28 transitions. Second operand 18 states. [2020-07-29 01:29:03,532 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 28 transitions. Second operand 18 states. [2020-07-29 01:29:03,532 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 18 states. [2020-07-29 01:29:03,532 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:03,534 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:29:03,534 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:29:03,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:03,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:03,535 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 21 states and 28 transitions. [2020-07-29 01:29:03,535 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 21 states and 28 transitions. [2020-07-29 01:29:03,535 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:03,537 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:29:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:29:03,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:03,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:03,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:03,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:03,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:29:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 01:29:03,538 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:29:03,538 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:29:03,538 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:29:03,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:29:03,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:03,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:03,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:03,539 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 01:29:03,539 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:29:03,539 INFO L794 eck$LassoCheckResult]: Stem: 1208#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 1206#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 1207#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 1211#L24-2 assume !(main_~y~0 < main_~z~0); 1219#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 1218#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 1217#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 1214#L24-2 assume !(main_~y~0 < main_~z~0); 1202#L24-3 [2020-07-29 01:29:03,540 INFO L796 eck$LassoCheckResult]: Loop: 1202#L24-3 main_~y~0 := main_~x~0 + main_~y~0; 1203#L22-2 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 1216#L24-2 assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; 1214#L24-2 assume !(main_~y~0 < main_~z~0); 1202#L24-3 [2020-07-29 01:29:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash -418159556, now seen corresponding path program 6 times [2020-07-29 01:29:03,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:03,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727642678] [2020-07-29 01:29:03,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:03,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1711282, now seen corresponding path program 1 times [2020-07-29 01:29:03,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:03,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137615521] [2020-07-29 01:29:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,564 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:03,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:03,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1441076371, now seen corresponding path program 7 times [2020-07-29 01:29:03,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:03,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023593511] [2020-07-29 01:29:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:03,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:03,584 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:03,654 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:03,654 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:03,654 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:03,654 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:03,654 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:03,654 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:03,655 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:03,655 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:03,655 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration6_Loop [2020-07-29 01:29:03,655 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:03,655 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:03,665 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:29:03,669 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:29:03,673 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:29:03,804 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:03,804 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:03,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:03,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:03,810 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:03,810 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:03,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:03,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:03,835 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:03,836 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:03,857 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:03,857 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:03,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:03,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:04,354 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:04,356 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:04,356 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:04,356 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:04,357 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:04,357 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:04,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:04,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:04,357 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:04,357 INFO L133 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c_Iteration6_Loop [2020-07-29 01:29:04,357 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:04,358 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:04,366 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:29:04,370 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:29:04,374 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:29:04,531 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:04,531 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:04,536 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:29:04,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:04,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:04,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:04,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:04,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:04,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:04,544 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:04,565 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:29:04,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:04,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:04,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:04,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:04,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:04,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:04,570 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:04,594 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 Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:04,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:04,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:04,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:04,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:04,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:04,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:04,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:04,601 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:04,606 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:29:04,606 INFO L444 ModelExtractionUtils]: 3 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:04,617 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:04,617 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:04,617 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:04,618 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2020-07-29 01:29:04,638 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:04,641 INFO L393 LassoCheck]: Loop: "main_~y~0 := main_~x~0 + main_~y~0;" "assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1;" "assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1;" "assume !(main_~y~0 < main_~z~0);" [2020-07-29 01:29:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:04,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {1317#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; {1317#unseeded} is VALID [2020-07-29 01:29:04,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {1317#unseeded} assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; {1317#unseeded} is VALID [2020-07-29 01:29:04,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {1317#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {1317#unseeded} is VALID [2020-07-29 01:29:04,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {1317#unseeded} assume !(main_~y~0 < main_~z~0); {1317#unseeded} is VALID [2020-07-29 01:29:04,682 INFO L280 TraceCheckUtils]: 4: Hoare triple {1317#unseeded} main_~y~0 := main_~x~0 + main_~y~0; {1317#unseeded} is VALID [2020-07-29 01:29:04,682 INFO L280 TraceCheckUtils]: 5: Hoare triple {1317#unseeded} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {1317#unseeded} is VALID [2020-07-29 01:29:04,682 INFO L280 TraceCheckUtils]: 6: Hoare triple {1317#unseeded} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {1317#unseeded} is VALID [2020-07-29 01:29:04,685 INFO L280 TraceCheckUtils]: 7: Hoare triple {1317#unseeded} assume !(main_~y~0 < main_~z~0); {1317#unseeded} is VALID [2020-07-29 01:29:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:04,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:04,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {1320#(>= oldRank0 ULTIMATE.start_main_~z~0)} main_~y~0 := main_~x~0 + main_~y~0; {1320#(>= oldRank0 ULTIMATE.start_main_~z~0)} is VALID [2020-07-29 01:29:04,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {1320#(>= oldRank0 ULTIMATE.start_main_~z~0)} assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; {1359#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~z~0 oldRank0))} is VALID [2020-07-29 01:29:04,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {1359#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~z~0 oldRank0))} assume !!(main_~y~0 < main_~z~0);main_~x~0 := 1 + main_~x~0;main_~z~0 := main_~z~0 - 1; {1363#(and (<= (+ ULTIMATE.start_main_~z~0 1) oldRank0) (<= 2 oldRank0))} is VALID [2020-07-29 01:29:04,783 INFO L280 TraceCheckUtils]: 3: Hoare triple {1363#(and (<= (+ ULTIMATE.start_main_~z~0 1) oldRank0) (<= 2 oldRank0))} assume !(main_~y~0 < main_~z~0); {1330#(or (and (> oldRank0 ULTIMATE.start_main_~z~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:04,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:04,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:04,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:04,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,791 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:29:04,792 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 01:29:04,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 35 states and 50 transitions. Complement of second has 6 states. [2020-07-29 01:29:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:04,830 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:04,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:04,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:04,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:04,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:04,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:04,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:04,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:04,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2020-07-29 01:29:04,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:04,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:04,833 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:04,833 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:04,833 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:04,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:04,834 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:04,834 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 50 transitions. cyclomatic complexity: 22 [2020-07-29 01:29:04,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. cyclomatic complexity: 22 [2020-07-29 01:29:04,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:04,834 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:04,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:04,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:04,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:04,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:04,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:04,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:04,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:29:04,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:29:04,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 22 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:29:04,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:04,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:04,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 22 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:04,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:04,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:04,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:04,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:04,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:04,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:04,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:04,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:04,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:04,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,839 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:29:04,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:29:04,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:04,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:04,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:04,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. cyclomatic complexity: 22 [2020-07-29 01:29:04,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:04,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2020-07-29 01:29:04,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:29:04,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:29:04,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:29:04,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:04,842 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:04,842 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:04,842 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:04,842 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:29:04,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:29:04,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:04,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:04,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:29:04 BoogieIcfgContainer [2020-07-29 01:29:04,848 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:29:04,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:29:04,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:29:04,849 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:29:04,850 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:55" (3/4) ... [2020-07-29 01:29:04,853 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:29:04,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:29:04,856 INFO L168 Benchmark]: Toolchain (without parser) took 10200.31 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 961.6 MB in the beginning and 1.2 GB in the end (delta: -284.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:04,856 INFO L168 Benchmark]: CDTParser took 0.27 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:29:04,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.76 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 949.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:04,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:04,858 INFO L168 Benchmark]: Boogie Preprocessor took 23.29 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:29:04,859 INFO L168 Benchmark]: RCFGBuilder took 260.54 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:04,859 INFO L168 Benchmark]: BuchiAutomizer took 9523.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.9 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:04,860 INFO L168 Benchmark]: Witness Printer took 4.50 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:04,862 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 0.27 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 285.76 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 949.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.29 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 260.54 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9523.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.9 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.50 ms. Allocated memory is still 1.4 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 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y) and consists of 5 locations. One deterministic module has affine ranking function -1 * y + z and consists of 4 locations. One deterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y + x) and consists of 5 locations. One deterministic module has affine ranking function z and consists of 4 locations. One nondeterministic module has affine ranking function z + -1 * y and consists of 4 locations. One nondeterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else x + y) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.1s. Construction of modules took 0.2s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 66 SDtfs, 90 SDslu, 8 SDs, 0 SdLazy, 143 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf97 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp97 dnf100 smp100 tf109 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...