./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.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-restricted-15/McCarthyIterative.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 a5e4c58569d8caa47946d30f6cb501096837aef1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:30:05,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:30:05,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:30:05,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:30:05,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:30:05,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:30:05,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:30:05,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:30:05,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:30:05,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:30:05,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:30:05,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:30:05,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:30:05,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:30:05,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:30:05,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:30:05,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:30:05,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:30:05,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:30:05,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:30:05,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:30:05,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:30:05,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:30:05,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:30:05,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:30:05,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:30:05,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:30:05,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:30:05,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:30:05,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:30:05,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:30:05,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:30:05,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:30:05,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:30:05,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:30:05,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:30:05,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:30:05,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:30:05,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:30:05,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:30:05,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:30:05,631 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:30:05,661 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:30:05,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:30:05,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:30:05,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:30:05,664 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:30:05,664 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:30:05,664 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:30:05,665 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:30:05,665 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:30:05,665 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:30:05,666 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:30:05,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:30:05,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:30:05,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:30:05,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:30:05,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:30:05,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:30:05,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:30:05,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:30:05,669 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:30:05,670 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:30:05,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:30:05,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:30:05,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:30:05,671 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:30:05,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:30:05,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:30:05,672 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:30:05,672 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:30:05,673 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:30:05,674 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 -> a5e4c58569d8caa47946d30f6cb501096837aef1 [2020-07-29 01:30:06,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:30:06,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:30:06,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:30:06,029 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:30:06,029 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:30:06,030 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2020-07-29 01:30:06,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e662146/abc5a23c42d64b3d9d14e2e1b8449b9a/FLAGdc5a647ca [2020-07-29 01:30:06,541 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:30:06,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2020-07-29 01:30:06,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e662146/abc5a23c42d64b3d9d14e2e1b8449b9a/FLAGdc5a647ca [2020-07-29 01:30:06,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e662146/abc5a23c42d64b3d9d14e2e1b8449b9a [2020-07-29 01:30:06,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:30:06,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:30:06,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:30:06,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:30:06,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:30:06,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:30:06" (1/1) ... [2020-07-29 01:30:06,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1d6c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:06, skipping insertion in model container [2020-07-29 01:30:06,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:30:06" (1/1) ... [2020-07-29 01:30:06,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:30:06,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:30:07,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:30:07,150 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:30:07,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:30:07,178 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:30:07,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07 WrapperNode [2020-07-29 01:30:07,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:30:07,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:30:07,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:30:07,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:30:07,190 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:30:07" (1/1) ... [2020-07-29 01:30:07,195 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:30:07" (1/1) ... [2020-07-29 01:30:07,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:30:07,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:30:07,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:30:07,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:30:07,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07" (1/1) ... [2020-07-29 01:30:07,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07" (1/1) ... [2020-07-29 01:30:07,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07" (1/1) ... [2020-07-29 01:30:07,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07" (1/1) ... [2020-07-29 01:30:07,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07" (1/1) ... [2020-07-29 01:30:07,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07" (1/1) ... [2020-07-29 01:30:07,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07" (1/1) ... [2020-07-29 01:30:07,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:30:07,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:30:07,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:30:07,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:30:07,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07" (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:30:07,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:30:07,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:30:07,543 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:30:07,544 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:30:07,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:30:07 BoogieIcfgContainer [2020-07-29 01:30:07,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:30:07,548 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:30:07,549 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:30:07,553 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:30:07,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:30:07,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:30:06" (1/3) ... [2020-07-29 01:30:07,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fe839dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:30:07, skipping insertion in model container [2020-07-29 01:30:07,556 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:30:07,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:07" (2/3) ... [2020-07-29 01:30:07,557 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fe839dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:30:07, skipping insertion in model container [2020-07-29 01:30:07,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:30:07,557 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:30:07" (3/3) ... [2020-07-29 01:30:07,559 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative.c [2020-07-29 01:30:07,626 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:30:07,626 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:30:07,627 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:30:07,627 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:30:07,627 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:30:07,628 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:30:07,628 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:30:07,628 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:30:07,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:30:07,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:07,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:07,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:07,683 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:30:07,684 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:30:07,684 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:30:07,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:30:07,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:07,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:07,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:07,688 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:30:07,688 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:30:07,697 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3#L12-2true [2020-07-29 01:30:07,698 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0 > 0); 6#L12true assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3#L12-2true [2020-07-29 01:30:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:30:07,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:07,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350357345] [2020-07-29 01:30:07,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:07,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:07,789 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:07,815 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:07,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2020-07-29 01:30:07,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:07,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006426261] [2020-07-29 01:30:07,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:07,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:07,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:07,864 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:07,869 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2020-07-29 01:30:07,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:07,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397438101] [2020-07-29 01:30:07,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:07,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:07,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:07,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:08,009 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:08,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:08,010 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:08,010 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:08,011 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:08,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:08,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:08,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2020-07-29 01:30:08,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:08,012 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:08,050 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:30:08,069 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:30:08,077 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:30:08,088 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:30:08,270 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:08,271 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:08,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:08,280 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,290 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:08,291 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:08,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:08,330 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,334 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:08,334 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:08,368 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:08,395 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:08,426 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:08,428 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:08,428 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:08,428 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:08,428 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:08,428 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:08,428 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,429 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:08,429 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:08,429 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2020-07-29 01:30:08,429 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:08,430 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:08,450 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:30:08,461 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:30:08,470 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:30:08,488 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:30:08,653 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:08,660 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:08,676 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:30:08,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:08,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:08,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:08,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:08,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:08,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:08,750 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:30:08,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:08,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:08,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:08,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:08,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:08,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,768 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:30:08,815 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:30:08,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:08,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:08,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:08,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:08,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:08,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:08,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:08,824 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:08,830 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:08,830 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:08,844 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:08,845 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:08,845 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:08,846 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:08,893 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:08,897 INFO L393 LassoCheck]: Loop: "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" [2020-07-29 01:30:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:08,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {17#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {17#unseeded} is VALID [2020-07-29 01:30:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,961 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:08,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:08,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {20#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:08,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {20#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {30#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:08,977 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:30:08,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:08,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:08,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,009 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:30:09,011 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2020-07-29 01:30:09,079 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2020-07-29 01:30:09,079 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:30:09,079 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:09,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:30:09,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:09,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:09,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:09,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:09,086 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:30:09,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:09,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:09,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:30:09,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:09,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:09,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:09,091 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:30:09,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:09,094 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:09,094 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:09,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:30:09,096 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:09,097 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:09,097 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:09,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:09,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:09,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:09,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:09,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:09,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:30:09,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:09,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:09,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:09,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:09,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:09,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:09,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:30:09,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:30:09,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:30:09,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:09,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:09,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:09,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:09,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:09,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:09,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:09,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:09,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:09,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,119 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:30:09,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:09,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:09,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:09,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:09,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:09,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2020-07-29 01:30:09,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:30:09,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:30:09,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-29 01:30:09,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:09,138 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:30:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-29 01:30:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:30:09,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:09,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:30:09,168 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:30:09,171 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:30:09,174 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:09,177 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:30:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:30:09,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:09,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:09,180 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:30:09,180 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:30:09,180 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:09,182 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:30:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:30:09,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:09,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:09,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:09,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-29 01:30:09,186 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:30:09,186 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:30:09,186 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:30:09,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:30:09,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:09,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:09,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:09,188 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:30:09,188 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:30:09,189 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 75#L12-2 assume !!(main_~c~0 > 0); 73#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 69#L12-2 [2020-07-29 01:30:09,189 INFO L796 eck$LassoCheckResult]: Loop: 69#L12-2 assume !!(main_~c~0 > 0); 70#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 69#L12-2 [2020-07-29 01:30:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-07-29 01:30:09,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:09,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181394386] [2020-07-29 01:30:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:09,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2020-07-29 01:30:09,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:09,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958909154] [2020-07-29 01:30:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:09,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2020-07-29 01:30:09,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:09,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396372618] [2020-07-29 01:30:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:09,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:09,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:09,264 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:09,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:09,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:09,265 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:09,265 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:09,265 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,265 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:09,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:09,265 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2020-07-29 01:30:09,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:09,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:09,276 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:30:09,281 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:30:09,289 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:30:09,295 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:30:09,436 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:09,437 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:09,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:09,442 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,446 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:09,447 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:09,506 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:09,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:09,559 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,603 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:09,606 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:09,606 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:09,606 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:09,606 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:09,607 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:09,607 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,607 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:09,607 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:09,607 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2020-07-29 01:30:09,607 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:09,608 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:09,617 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:30:09,622 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:30:09,631 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:30:09,640 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:30:09,766 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:09,766 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:09,778 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:30:09,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:09,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:09,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:09,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:09,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:09,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,833 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:30:09,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:09,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:09,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:09,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:09,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:09,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:09,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:09,841 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:09,845 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:30:09,845 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:09,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:09,857 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:09,858 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:09,858 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:09,897 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:09,901 INFO L393 LassoCheck]: Loop: "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" [2020-07-29 01:30:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:09,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:09,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:09,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {119#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {119#unseeded} is VALID [2020-07-29 01:30:09,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {119#unseeded} assume !!(main_~c~0 > 0); {119#unseeded} is VALID [2020-07-29 01:30:09,935 INFO L280 TraceCheckUtils]: 2: Hoare triple {119#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {119#unseeded} is VALID [2020-07-29 01:30:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:09,940 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:09,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:09,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume !!(main_~c~0 > 0); {143#(and (< 0 ULTIMATE.start_main_~c~0) (<= ULTIMATE.start_main_~c~0 oldRank0))} is VALID [2020-07-29 01:30:09,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {143#(and (< 0 ULTIMATE.start_main_~c~0) (<= ULTIMATE.start_main_~c~0 oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {132#(or (and (> oldRank0 ULTIMATE.start_main_~c~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:09,966 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:30:09,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:09,973 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:30:09,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:09,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:09,974 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:30:09,974 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:30:10,003 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2020-07-29 01:30:10,003 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:30:10,003 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:10,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:10,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:30:10,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,007 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:10,007 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:10,007 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:10,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,009 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:10,009 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,010 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:10,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:10,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:10,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:10,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:10,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:10,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:10,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:10,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:10,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:10,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:10,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,025 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:30:10,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:10,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:30:10,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2020-07-29 01:30:10,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:30:10,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:30:10,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2020-07-29 01:30:10,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:10,032 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:30:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2020-07-29 01:30:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:30:10,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:10,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:30:10,034 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:30:10,034 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:30:10,034 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:10,036 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:30:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:30:10,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:10,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:10,037 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 16 transitions. [2020-07-29 01:30:10,037 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 16 transitions. [2020-07-29 01:30:10,037 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:10,039 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:30:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:30:10,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:10,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:10,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:10,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:30:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-29 01:30:10,042 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:30:10,042 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:30:10,042 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:30:10,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:30:10,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-29 01:30:10,044 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:30:10,044 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 171#L12-2 assume !!(main_~c~0 > 0); 169#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 172#L12-2 assume !!(main_~c~0 > 0); 173#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 165#L12-2 [2020-07-29 01:30:10,044 INFO L796 eck$LassoCheckResult]: Loop: 165#L12-2 assume !!(main_~c~0 > 0); 166#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 165#L12-2 [2020-07-29 01:30:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,045 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2020-07-29 01:30:10,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:10,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502845656] [2020-07-29 01:30:10,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,052 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,058 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,060 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2020-07-29 01:30:10,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:10,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099806296] [2020-07-29 01:30:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2020-07-29 01:30:10,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:10,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330308145] [2020-07-29 01:30:10,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,093 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:10,122 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:10,122 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:10,122 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:10,122 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:10,123 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:10,123 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:10,123 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:10,123 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:10,123 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2020-07-29 01:30:10,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:10,124 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:10,135 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:30:10,145 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:30:10,152 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:30:10,161 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:30:10,308 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:10,308 INFO L404 LassoAnalysis]: Checking for nontermination... 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:30:10,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:10,321 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:10,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:10,370 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:10,407 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:10,410 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:10,410 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:10,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:10,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:10,410 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:10,411 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:10,411 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:10,411 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:10,411 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2020-07-29 01:30:10,411 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:10,412 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:10,462 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:30:10,509 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:30:10,516 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:30:10,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:30:10,624 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:10,625 INFO L489 LassoAnalysis]: Using template 'affine'. 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:30:10,630 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:30:10,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:10,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:10,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:10,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:10,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:10,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:10,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:10,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:10,646 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:10,646 INFO L444 ModelExtractionUtils]: 0 out of 3 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 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:30:10,654 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:10,655 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:10,655 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:10,656 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:30:10,686 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:10,691 INFO L393 LassoCheck]: Loop: "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" [2020-07-29 01:30:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:10,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {233#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {233#unseeded} is VALID [2020-07-29 01:30:10,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {233#unseeded} assume !!(main_~c~0 > 0); {233#unseeded} is VALID [2020-07-29 01:30:10,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {233#unseeded} is VALID [2020-07-29 01:30:10,721 INFO L280 TraceCheckUtils]: 3: Hoare triple {233#unseeded} assume !!(main_~c~0 > 0); {233#unseeded} is VALID [2020-07-29 01:30:10,722 INFO L280 TraceCheckUtils]: 4: Hoare triple {233#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {233#unseeded} is VALID [2020-07-29 01:30:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,726 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:10,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {236#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:10,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {246#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:10,736 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:30:10,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:10,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:10,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,740 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:30:10,740 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:30:10,773 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2020-07-29 01:30:10,774 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:30:10,774 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:10,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2020-07-29 01:30:10,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,780 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,781 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:10,781 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:10,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,782 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:10,783 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 20 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:10,783 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:10,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:10,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:10,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:10,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,792 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:30:10,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,793 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:10,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {233#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {233#unseeded} is VALID [2020-07-29 01:30:10,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {233#unseeded} assume !!(main_~c~0 > 0); {233#unseeded} is VALID [2020-07-29 01:30:10,822 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {233#unseeded} is VALID [2020-07-29 01:30:10,822 INFO L280 TraceCheckUtils]: 3: Hoare triple {233#unseeded} assume !!(main_~c~0 > 0); {233#unseeded} is VALID [2020-07-29 01:30:10,823 INFO L280 TraceCheckUtils]: 4: Hoare triple {233#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {233#unseeded} is VALID [2020-07-29 01:30:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,831 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:10,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {236#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:10,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {246#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:10,845 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:30:10,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:10,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:10,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,854 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:30:10,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:30:10,871 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2020-07-29 01:30:10,871 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:30:10,871 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:10,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2020-07-29 01:30:10,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,874 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,874 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:10,874 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:10,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,875 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:10,875 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 20 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:10,875 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:10,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:10,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:10,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:10,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,884 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:30:10,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,885 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:10,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {233#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {233#unseeded} is VALID [2020-07-29 01:30:10,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {233#unseeded} assume !!(main_~c~0 > 0); {233#unseeded} is VALID [2020-07-29 01:30:10,914 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {233#unseeded} is VALID [2020-07-29 01:30:10,914 INFO L280 TraceCheckUtils]: 3: Hoare triple {233#unseeded} assume !!(main_~c~0 > 0); {233#unseeded} is VALID [2020-07-29 01:30:10,915 INFO L280 TraceCheckUtils]: 4: Hoare triple {233#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {233#unseeded} is VALID [2020-07-29 01:30:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,918 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:10,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:10,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {236#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:10,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {246#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:10,924 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:30:10,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:10,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:10,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,930 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:30:10,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:30:10,949 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2020-07-29 01:30:10,949 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:30:10,949 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:10,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. [2020-07-29 01:30:10,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:10,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,952 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:10,952 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:10,952 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:10,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:10,953 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:10,953 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 23 transitions. cyclomatic complexity: 11 [2020-07-29 01:30:10,953 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:10,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:10,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:10,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:10,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,961 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:30:10,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:10,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:30:10,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:30:10,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:10,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. cyclomatic complexity: 11 [2020-07-29 01:30:10,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:10,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2020-07-29 01:30:10,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:30:10,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:30:10,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2020-07-29 01:30:10,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:10,966 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:30:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2020-07-29 01:30:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2020-07-29 01:30:10,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:10,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 19 transitions. Second operand 5 states. [2020-07-29 01:30:10,967 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 19 transitions. Second operand 5 states. [2020-07-29 01:30:10,967 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 5 states. [2020-07-29 01:30:10,968 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:10,969 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-29 01:30:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:30:10,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:10,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:10,969 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 13 states and 19 transitions. [2020-07-29 01:30:10,969 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 13 states and 19 transitions. [2020-07-29 01:30:10,970 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:10,971 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-29 01:30:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:30:10,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:10,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:10,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:10,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:30:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2020-07-29 01:30:10,972 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-07-29 01:30:10,972 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-07-29 01:30:10,973 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:30:10,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2020-07-29 01:30:10,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:10,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:10,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:10,973 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:30:10,973 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:30:10,974 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 365#L12-2 [2020-07-29 01:30:10,974 INFO L796 eck$LassoCheckResult]: Loop: 365#L12-2 assume !!(main_~c~0 > 0); 366#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 365#L12-2 [2020-07-29 01:30:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:30:10,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:10,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476547108] [2020-07-29 01:30:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,978 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,980 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2020-07-29 01:30:10,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:10,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22462600] [2020-07-29 01:30:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:10,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:10,990 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2020-07-29 01:30:10,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:10,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109588752] [2020-07-29 01:30:10,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:10,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:10,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:11,021 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:11,021 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:11,021 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:11,021 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:11,021 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:11,021 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:11,022 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:11,022 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:11,022 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2020-07-29 01:30:11,022 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:11,022 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:11,029 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:30:11,033 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:30:11,041 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:30:11,045 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:30:11,147 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:11,147 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 01:30:11,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:11,155 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:11,160 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:11,160 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:11,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:11,227 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 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 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:30:11,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:11,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:11,291 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:11,292 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 10, 14] Nus: [1, 0] 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) [2020-07-29 01:30:11,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:11,331 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:11,335 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:11,335 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:11,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:11,372 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-07-29 01:30:11,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:11,398 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:11,433 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:11,434 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:11,435 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:11,435 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:11,435 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:11,435 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:11,435 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:11,435 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:11,435 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:11,436 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2020-07-29 01:30:11,436 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:11,436 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:11,445 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:30:11,454 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:30:11,462 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:30:11,466 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:30:11,588 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:11,588 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:30:11,596 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:30:11,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:11,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:11,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:11,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:11,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:11,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:11,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:11,602 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 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:30:11,627 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:30:11,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:11,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:11,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:11,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:11,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:11,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:11,635 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:11,669 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:30:11,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:11,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:11,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:11,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:11,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:11,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:11,680 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:11,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:11,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:11,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:11,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:11,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:11,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:11,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:11,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:11,709 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:11,711 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:11,711 INFO L444 ModelExtractionUtils]: 0 out of 3 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 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:30:11,714 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:11,714 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:11,715 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:11,715 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2020-07-29 01:30:11,739 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:11,741 INFO L393 LassoCheck]: Loop: "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" [2020-07-29 01:30:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:11,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:11,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:11,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {427#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {427#unseeded} is VALID [2020-07-29 01:30:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:11,776 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:11,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:11,782 INFO L280 TraceCheckUtils]: 0: Hoare triple {430#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211))} assume !!(main_~c~0 > 0); {430#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211))} is VALID [2020-07-29 01:30:11,783 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {440#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:11,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:30:11,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:11,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:11,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,788 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:30:11,789 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:30:11,805 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2020-07-29 01:30:11,805 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:30:11,805 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:11,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:11,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:11,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:11,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:11,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:11,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:11,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:11,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. [2020-07-29 01:30:11,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:11,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:11,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:11,809 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:11,809 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:11,809 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:11,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:11,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:11,810 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:11,811 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:11,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:11,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:11,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:11,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:11,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:11,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:11,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:11,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:11,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:11,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:11,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:11,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:11,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:30:11,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:30:11,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:30:11,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:11,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:11,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:11,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:11,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:11,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:11,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,821 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2020-07-29 01:30:11,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:11,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:30:11,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:11,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:11,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:11,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:11,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2020-07-29 01:30:11,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:30:11,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:30:11,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-07-29 01:30:11,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:11,826 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-07-29 01:30:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-07-29 01:30:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-29 01:30:11,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:11,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 13 transitions. Second operand 8 states. [2020-07-29 01:30:11,827 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 13 transitions. Second operand 8 states. [2020-07-29 01:30:11,827 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 8 states. [2020-07-29 01:30:11,827 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:11,828 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2020-07-29 01:30:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2020-07-29 01:30:11,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:11,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:11,829 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states and 13 transitions. [2020-07-29 01:30:11,829 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states and 13 transitions. [2020-07-29 01:30:11,829 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:11,830 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2020-07-29 01:30:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2020-07-29 01:30:11,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:11,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:11,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:11,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:30:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-07-29 01:30:11,832 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-07-29 01:30:11,832 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-07-29 01:30:11,832 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:30:11,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2020-07-29 01:30:11,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:11,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:11,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:11,834 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-07-29 01:30:11,834 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:30:11,834 INFO L794 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 466#L12-2 assume !!(main_~c~0 > 0); 468#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 473#L12-2 assume !!(main_~c~0 > 0); 471#L12 [2020-07-29 01:30:11,834 INFO L796 eck$LassoCheckResult]: Loop: 471#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 472#L12-2 assume !!(main_~c~0 > 0); 471#L12 [2020-07-29 01:30:11,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:11,835 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2020-07-29 01:30:11,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:11,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894051788] [2020-07-29 01:30:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:11,890 INFO L280 TraceCheckUtils]: 0: Hoare triple {517#true} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {519#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:11,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {519#(<= ULTIMATE.start_main_~c~0 1)} assume !!(main_~c~0 > 0); {519#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:11,892 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#(<= ULTIMATE.start_main_~c~0 1)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {520#(<= ULTIMATE.start_main_~c~0 0)} is VALID [2020-07-29 01:30:11,893 INFO L280 TraceCheckUtils]: 3: Hoare triple {520#(<= ULTIMATE.start_main_~c~0 0)} assume !!(main_~c~0 > 0); {518#false} is VALID [2020-07-29 01:30:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:11,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894051788] [2020-07-29 01:30:11,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:30:11,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:30:11,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787597779] [2020-07-29 01:30:11,899 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:30:11,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:11,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2020-07-29 01:30:11,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:11,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766039683] [2020-07-29 01:30:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:11,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:11,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:11,907 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:11,928 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:11,928 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:11,928 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:11,928 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:11,928 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:11,929 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:11,929 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:11,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:11,929 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2020-07-29 01:30:11,929 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:11,929 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:11,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:11,943 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:30:11,950 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:30:11,954 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:30:12,048 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:12,049 INFO L404 LassoAnalysis]: Checking for nontermination... 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:30:12,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:12,055 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:30:12,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:12,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:12,095 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:12,095 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [4, 1, 15] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:12,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:12,117 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:12,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:12,144 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:12,169 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:12,171 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:12,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:12,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:12,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:12,171 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:12,171 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:12,171 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:12,171 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:12,172 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2020-07-29 01:30:12,172 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:12,172 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:12,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:12,188 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:30:12,192 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:30:12,199 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:30:12,317 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:12,317 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:30:12,324 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:30:12,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:12,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:12,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:12,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:12,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:12,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:12,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:12,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:12,362 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:12,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:12,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:12,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:12,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:12,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:12,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:12,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:12,406 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:30:12,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:12,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:12,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:12,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:12,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:12,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:12,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:12,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:12,417 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:12,417 INFO L444 ModelExtractionUtils]: 0 out of 3 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 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:30:12,420 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:12,420 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:12,420 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:12,420 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2020-07-29 01:30:12,442 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:12,447 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" [2020-07-29 01:30:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:12,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {523#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {523#unseeded} is VALID [2020-07-29 01:30:12,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#unseeded} assume !!(main_~c~0 > 0); {523#unseeded} is VALID [2020-07-29 01:30:12,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {523#unseeded} is VALID [2020-07-29 01:30:12,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#unseeded} assume !!(main_~c~0 > 0); {523#unseeded} is VALID [2020-07-29 01:30:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,483 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:12,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {526#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {550#(and (<= (div (+ oldRank0 (- 211)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 211)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:12,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {550#(and (<= (div (+ oldRank0 (- 211)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 211)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 > 0); {536#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:12,594 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:30:12,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:12,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:12,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,614 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:30:12,614 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:30:12,634 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2020-07-29 01:30:12,634 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:30:12,634 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:12,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:12,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:12,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:12,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:30:12,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:12,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,639 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 12 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:12,640 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:12,640 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:12,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:12,641 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:12,641 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:12,641 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:12,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:12,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:12,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:12,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:12,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:12,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:12,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:12,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:12,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:12,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:12,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:12,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:12,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:12,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:12,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:12,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,656 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:30:12,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,657 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:12,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {523#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {523#unseeded} is VALID [2020-07-29 01:30:12,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#unseeded} assume !!(main_~c~0 > 0); {523#unseeded} is VALID [2020-07-29 01:30:12,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {523#unseeded} is VALID [2020-07-29 01:30:12,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#unseeded} assume !!(main_~c~0 > 0); {523#unseeded} is VALID [2020-07-29 01:30:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,695 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:12,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {526#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {587#(and (<= (div (+ oldRank0 (- 211)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 211)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:12,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#(and (<= (div (+ oldRank0 (- 211)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 211)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 > 0); {536#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:12,802 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:30:12,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:12,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:12,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,813 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:30:12,813 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:30:12,851 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2020-07-29 01:30:12,851 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:30:12,851 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:12,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:12,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:12,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:12,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:30:12,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:12,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:12,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:12,855 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 12 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:12,859 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:12,860 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:12,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:12,860 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:12,860 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 14 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:12,861 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:12,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:12,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:12,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:12,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:12,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:12,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,868 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:30:12,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:12,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:12,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:12,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:12,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:12,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:12,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:12,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:12,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:12,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:12,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,877 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-07-29 01:30:12,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:12,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:12,878 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:12,904 INFO L280 TraceCheckUtils]: 0: Hoare triple {523#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {523#unseeded} is VALID [2020-07-29 01:30:12,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#unseeded} assume !!(main_~c~0 > 0); {523#unseeded} is VALID [2020-07-29 01:30:12,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {523#unseeded} is VALID [2020-07-29 01:30:12,907 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#unseeded} assume !!(main_~c~0 > 0); {523#unseeded} is VALID [2020-07-29 01:30:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,915 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:12,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:12,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {526#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {621#(and (<= (div (+ oldRank0 (- 211)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 211)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:12,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {621#(and (<= (div (+ oldRank0 (- 211)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 211)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 > 0); {536#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 211)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:12,996 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:30:12,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:13,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:13,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:13,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,003 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:30:13,004 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:30:13,035 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2020-07-29 01:30:13,035 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:30:13,035 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:13,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:13,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:13,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:30:13,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:30:13,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,040 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 12 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:13,041 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:13,041 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:13,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:13,041 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,042 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 20 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:13,042 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:13,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:13,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:13,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:13,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:13,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:13,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:30:13,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:30:13,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:30:13,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:13,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:13,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:13,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:13,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:13,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:13,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:13,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:13,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:30:13,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:13,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:13,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:13,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,051 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:30:13,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:30:13,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:13,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:13,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:13,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:30:13,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2020-07-29 01:30:13,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:30:13,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:30:13,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-07-29 01:30:13,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:13,056 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:30:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-07-29 01:30:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2020-07-29 01:30:13,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:13,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand 7 states. [2020-07-29 01:30:13,057 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand 7 states. [2020-07-29 01:30:13,057 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2020-07-29 01:30:13,058 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:13,058 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:30:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:30:13,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:13,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:13,059 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 12 states and 16 transitions. [2020-07-29 01:30:13,059 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 12 states and 16 transitions. [2020-07-29 01:30:13,060 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:13,061 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:30:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:30:13,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:13,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:13,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:13,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-29 01:30:13,062 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:30:13,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:13,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:30:13,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:30:13,068 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2020-07-29 01:30:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:13,106 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2020-07-29 01:30:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:30:13,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:13,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:13,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2020-07-29 01:30:13,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:30:13,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2020-07-29 01:30:13,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:30:13,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:30:13,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2020-07-29 01:30:13,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:13,116 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:30:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2020-07-29 01:30:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-07-29 01:30:13,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:13,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:30:13,117 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:30:13,118 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:30:13,118 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:13,119 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:30:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:30:13,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:13,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:13,119 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states and 10 transitions. [2020-07-29 01:30:13,134 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states and 10 transitions. [2020-07-29 01:30:13,134 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:13,135 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:30:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:30:13,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:13,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:13,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:13,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:30:13,136 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:30:13,136 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:30:13,136 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:30:13,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:30:13,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:30:13,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2020-07-29 01:30:13,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-07-29 01:30:13,137 INFO L794 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 715#L12-2 assume !!(main_~c~0 > 0); 716#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 717#L12-2 assume !!(main_~c~0 > 0); 718#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 721#L12-2 assume !!(main_~c~0 > 0); 720#L12 [2020-07-29 01:30:13,137 INFO L796 eck$LassoCheckResult]: Loop: 720#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 717#L12-2 assume !!(main_~c~0 > 0); 718#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 721#L12-2 assume !!(main_~c~0 > 0); 720#L12 [2020-07-29 01:30:13,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:13,138 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2020-07-29 01:30:13,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:13,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476446877] [2020-07-29 01:30:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:13,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:13,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:13,169 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2020-07-29 01:30:13,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:13,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664017840] [2020-07-29 01:30:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:13,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:13,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:13,190 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:13,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2020-07-29 01:30:13,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:13,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201988577] [2020-07-29 01:30:13,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:13,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:13,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:13,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:13,288 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:13,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:13,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:13,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:13,288 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:13,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:13,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:13,289 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:13,289 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2020-07-29 01:30:13,289 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:13,289 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:13,296 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:30:13,300 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:30:13,303 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:30:13,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:30:13,417 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:13,417 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:13,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:13,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:13,424 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:13,424 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 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:30:13,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:13,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:13,448 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:13,448 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 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:30:13,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:13,471 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:30:13,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:13,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:13,520 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:13,521 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:13,521 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:13,522 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:13,522 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:13,522 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:13,522 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:13,522 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:13,522 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:13,522 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2020-07-29 01:30:13,522 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:13,522 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:13,532 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:30:13,540 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:30:13,544 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:30:13,549 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:30:13,661 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:13,662 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:30:13,677 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:30:13,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:13,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:13,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:13,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:13,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:13,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:13,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:13,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:13,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:13,694 INFO L444 ModelExtractionUtils]: 0 out of 3 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 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:30:13,702 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:13,703 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:13,703 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:13,703 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2020-07-29 01:30:13,725 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:13,728 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" [2020-07-29 01:30:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:13,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {775#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {775#unseeded} is VALID [2020-07-29 01:30:13,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:13,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {775#unseeded} is VALID [2020-07-29 01:30:13,763 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:13,764 INFO L280 TraceCheckUtils]: 4: Hoare triple {775#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {775#unseeded} is VALID [2020-07-29 01:30:13,764 INFO L280 TraceCheckUtils]: 5: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:13,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {778#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {808#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:13,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {808#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 > 0); {808#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:13,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {808#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {815#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2020-07-29 01:30:13,896 INFO L280 TraceCheckUtils]: 3: Hoare triple {815#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume !!(main_~c~0 > 0); {788#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))))} is VALID [2020-07-29 01:30:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:13,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:13,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:13,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,907 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:30:13,907 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-07-29 01:30:13,925 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2020-07-29 01:30:13,925 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:30:13,925 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:13,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:13,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:13,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2020-07-29 01:30:13,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:30:13,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:13,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:13,928 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:13,929 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,929 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:13,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:13,929 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,929 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:13,930 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:13,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:13,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:13,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:13,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:13,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:13,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:13,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:13,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,940 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:30:13,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:13,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:13,941 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:13,966 INFO L280 TraceCheckUtils]: 0: Hoare triple {775#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {775#unseeded} is VALID [2020-07-29 01:30:13,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:13,967 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {775#unseeded} is VALID [2020-07-29 01:30:13,968 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:13,969 INFO L280 TraceCheckUtils]: 4: Hoare triple {775#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {775#unseeded} is VALID [2020-07-29 01:30:13,969 INFO L280 TraceCheckUtils]: 5: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:13,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:14,086 INFO L280 TraceCheckUtils]: 0: Hoare triple {778#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {858#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:14,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {858#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 > 0); {858#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:14,089 INFO L280 TraceCheckUtils]: 2: Hoare triple {858#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {865#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2020-07-29 01:30:14,090 INFO L280 TraceCheckUtils]: 3: Hoare triple {865#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume !!(main_~c~0 > 0); {788#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))))} is VALID [2020-07-29 01:30:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:14,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:14,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:14,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,102 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:30:14,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-07-29 01:30:14,135 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2020-07-29 01:30:14,136 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:30:14,136 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:14,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:14,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:14,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:14,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:30:14,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:30:14,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,138 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:14,138 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,138 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:14,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:14,138 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,138 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:14,139 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:30:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:14,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:14,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:14,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,144 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-07-29 01:30:14,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,145 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:14,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:14,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {775#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {775#unseeded} is VALID [2020-07-29 01:30:14,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:14,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {775#unseeded} is VALID [2020-07-29 01:30:14,176 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:14,177 INFO L280 TraceCheckUtils]: 4: Hoare triple {775#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {775#unseeded} is VALID [2020-07-29 01:30:14,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:14,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {778#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {906#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:14,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {906#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 > 0); {906#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:14,299 INFO L280 TraceCheckUtils]: 2: Hoare triple {906#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {913#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2020-07-29 01:30:14,300 INFO L280 TraceCheckUtils]: 3: Hoare triple {913#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume !!(main_~c~0 > 0); {788#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))))} is VALID [2020-07-29 01:30:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:14,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:14,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:14,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,310 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:30:14,310 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-07-29 01:30:14,339 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2020-07-29 01:30:14,340 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:30:14,340 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:14,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:14,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:14,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:14,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-07-29 01:30:14,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:30:14,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,343 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:14,343 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,343 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:14,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:14,344 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,344 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:14,344 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:30:14,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:30:14,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:30:14,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:14,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:14,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:14,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,353 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:30:14,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,354 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:14,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {775#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {775#unseeded} is VALID [2020-07-29 01:30:14,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:14,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {775#unseeded} is VALID [2020-07-29 01:30:14,389 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:14,389 INFO L280 TraceCheckUtils]: 4: Hoare triple {775#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {775#unseeded} is VALID [2020-07-29 01:30:14,390 INFO L280 TraceCheckUtils]: 5: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:14,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {778#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {958#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:14,517 INFO L280 TraceCheckUtils]: 1: Hoare triple {958#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 > 0); {958#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:14,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {958#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {965#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2020-07-29 01:30:14,519 INFO L280 TraceCheckUtils]: 3: Hoare triple {965#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume !!(main_~c~0 > 0); {788#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))))} is VALID [2020-07-29 01:30:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:14,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:14,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:14,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,533 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:14,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-07-29 01:30:14,563 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2020-07-29 01:30:14,563 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:30:14,563 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:14,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:14,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:14,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:14,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:30:14,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:14,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,566 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:14,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,567 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:14,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:14,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,567 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:30:14,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,574 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:30:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,575 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:14,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:14,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {775#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {775#unseeded} is VALID [2020-07-29 01:30:14,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:14,604 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {775#unseeded} is VALID [2020-07-29 01:30:14,605 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:14,605 INFO L280 TraceCheckUtils]: 4: Hoare triple {775#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {775#unseeded} is VALID [2020-07-29 01:30:14,606 INFO L280 TraceCheckUtils]: 5: Hoare triple {775#unseeded} assume !!(main_~c~0 > 0); {775#unseeded} is VALID [2020-07-29 01:30:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:14,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {778#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1007#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:14,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {1007#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 > 0); {1007#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:30:14,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {1007#(and (<= (div (+ oldRank0 (- 201)) (- 2)) 100) (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) ULTIMATE.start_main_~x~0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1014#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2020-07-29 01:30:14,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {1014#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume !!(main_~c~0 > 0); {788#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 201))))} is VALID [2020-07-29 01:30:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:14,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:14,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:14,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,743 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:14,744 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-07-29 01:30:14,842 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2020-07-29 01:30:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:14,843 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2020-07-29 01:30:14,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:14,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:14,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:14,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 96 transitions. [2020-07-29 01:30:14,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:30:14,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,847 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:30:14,847 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,847 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:14,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:14,848 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,848 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 72 states and 96 transitions. cyclomatic complexity: 26 [2020-07-29 01:30:14,848 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:14,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 96 transitions. cyclomatic complexity: 26 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 96 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:14,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:14,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 96 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:14,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 72 letters. Loop has 72 letters. [2020-07-29 01:30:14,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 72 letters. Loop has 72 letters. [2020-07-29 01:30:14,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 96 transitions. cyclomatic complexity: 26 Stem has 72 letters. Loop has 72 letters. [2020-07-29 01:30:14,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 96 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:14,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:14,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:14,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 96 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:14,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 96 transitions. cyclomatic complexity: 26 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 96 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:14,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:14,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:14,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 96 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:14,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,857 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2020-07-29 01:30:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-29 01:30:14,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:30:14,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:30:14,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:30:14,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:14,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. cyclomatic complexity: 26 [2020-07-29 01:30:14,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:30:14,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2020-07-29 01:30:14,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2020-07-29 01:30:14,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2020-07-29 01:30:14,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2020-07-29 01:30:14,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:14,863 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2020-07-29 01:30:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2020-07-29 01:30:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2020-07-29 01:30:14,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:14,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 38 transitions. Second operand 15 states. [2020-07-29 01:30:14,865 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 38 transitions. Second operand 15 states. [2020-07-29 01:30:14,866 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand 15 states. [2020-07-29 01:30:14,866 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:14,867 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2020-07-29 01:30:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2020-07-29 01:30:14,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:14,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:14,868 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 27 states and 38 transitions. [2020-07-29 01:30:14,868 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 27 states and 38 transitions. [2020-07-29 01:30:14,868 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:14,869 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2020-07-29 01:30:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2020-07-29 01:30:14,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:14,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:14,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:14,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:30:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2020-07-29 01:30:14,871 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2020-07-29 01:30:14,871 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2020-07-29 01:30:14,871 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:30:14,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2020-07-29 01:30:14,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:14,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:14,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:14,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2020-07-29 01:30:14,872 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2020-07-29 01:30:14,873 INFO L794 eck$LassoCheckResult]: Stem: 1133#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1134#L12-2 assume !!(main_~c~0 > 0); 1137#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1136#L12-2 assume !!(main_~c~0 > 0); 1141#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1140#L12-2 assume !!(main_~c~0 > 0); 1139#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1138#L12-2 assume !!(main_~c~0 > 0); 1135#L12 [2020-07-29 01:30:14,873 INFO L796 eck$LassoCheckResult]: Loop: 1135#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1136#L12-2 assume !!(main_~c~0 > 0); 1141#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1140#L12-2 assume !!(main_~c~0 > 0); 1139#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1138#L12-2 assume !!(main_~c~0 > 0); 1135#L12 [2020-07-29 01:30:14,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:14,873 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2020-07-29 01:30:14,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:14,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515391355] [2020-07-29 01:30:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {1231#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:14,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {1231#(<= ULTIMATE.start_main_~c~0 1)} assume !!(main_~c~0 > 0); {1231#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:14,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {1231#(<= ULTIMATE.start_main_~c~0 1)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1232#(<= ULTIMATE.start_main_~c~0 2)} is VALID [2020-07-29 01:30:14,914 INFO L280 TraceCheckUtils]: 3: Hoare triple {1232#(<= ULTIMATE.start_main_~c~0 2)} assume !!(main_~c~0 > 0); {1232#(<= ULTIMATE.start_main_~c~0 2)} is VALID [2020-07-29 01:30:14,915 INFO L280 TraceCheckUtils]: 4: Hoare triple {1232#(<= ULTIMATE.start_main_~c~0 2)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1231#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:14,915 INFO L280 TraceCheckUtils]: 5: Hoare triple {1231#(<= ULTIMATE.start_main_~c~0 1)} assume !!(main_~c~0 > 0); {1231#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:14,916 INFO L280 TraceCheckUtils]: 6: Hoare triple {1231#(<= ULTIMATE.start_main_~c~0 1)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1233#(<= ULTIMATE.start_main_~c~0 0)} is VALID [2020-07-29 01:30:14,917 INFO L280 TraceCheckUtils]: 7: Hoare triple {1233#(<= ULTIMATE.start_main_~c~0 0)} assume !!(main_~c~0 > 0); {1230#false} is VALID [2020-07-29 01:30:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:30:14,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515391355] [2020-07-29 01:30:14,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359094239] [2020-07-29 01:30:14,918 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:30:14,939 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-07-29 01:30:14,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:30:14,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:30:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:14,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:15,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {1231#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:15,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {1231#(<= ULTIMATE.start_main_~c~0 1)} assume !!(main_~c~0 > 0); {1231#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:15,010 INFO L280 TraceCheckUtils]: 2: Hoare triple {1231#(<= ULTIMATE.start_main_~c~0 1)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1232#(<= ULTIMATE.start_main_~c~0 2)} is VALID [2020-07-29 01:30:15,011 INFO L280 TraceCheckUtils]: 3: Hoare triple {1232#(<= ULTIMATE.start_main_~c~0 2)} assume !!(main_~c~0 > 0); {1232#(<= ULTIMATE.start_main_~c~0 2)} is VALID [2020-07-29 01:30:15,012 INFO L280 TraceCheckUtils]: 4: Hoare triple {1232#(<= ULTIMATE.start_main_~c~0 2)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1231#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:15,013 INFO L280 TraceCheckUtils]: 5: Hoare triple {1231#(<= ULTIMATE.start_main_~c~0 1)} assume !!(main_~c~0 > 0); {1231#(<= ULTIMATE.start_main_~c~0 1)} is VALID [2020-07-29 01:30:15,013 INFO L280 TraceCheckUtils]: 6: Hoare triple {1231#(<= ULTIMATE.start_main_~c~0 1)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1233#(<= ULTIMATE.start_main_~c~0 0)} is VALID [2020-07-29 01:30:15,014 INFO L280 TraceCheckUtils]: 7: Hoare triple {1233#(<= ULTIMATE.start_main_~c~0 0)} assume !!(main_~c~0 > 0); {1230#false} is VALID [2020-07-29 01:30:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:30:15,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:30:15,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 01:30:15,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838909196] [2020-07-29 01:30:15,015 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:30:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2020-07-29 01:30:15,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:15,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116086350] [2020-07-29 01:30:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:15,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:15,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:15,026 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:15,117 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:15,117 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:15,117 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:15,117 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:15,117 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:15,117 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:15,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:15,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:15,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2020-07-29 01:30:15,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:15,118 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:15,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:30:15,128 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:30:15,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:30:15,142 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:30:15,254 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:15,254 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:30:15,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:15,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:15,260 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:15,260 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} 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:30:15,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:15,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:15,284 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:15,284 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} 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:30:15,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:15,307 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:30:15,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:15,330 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:15,384 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:15,386 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:15,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:15,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:15,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:15,386 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:15,387 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:15,387 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:15,387 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:15,387 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2020-07-29 01:30:15,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:15,387 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:15,394 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:30:15,398 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:30:15,405 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:30:15,412 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:30:15,536 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:15,536 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) [2020-07-29 01:30:15,540 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:15,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:15,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:15,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:15,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:15,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:15,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:15,548 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:30:15,570 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:30:15,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:15,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:15,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:15,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:15,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:15,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:15,575 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) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:15,600 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:30:15,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:15,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:15,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:15,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:15,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:15,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:15,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:15,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:15,608 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:30:15,608 INFO L444 ModelExtractionUtils]: 1 out of 3 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:30:15,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:15,610 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:15,611 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:15,611 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-07-29 01:30:15,633 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:15,635 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" [2020-07-29 01:30:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:15,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:15,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:15,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {1257#unseeded} is VALID [2020-07-29 01:30:15,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#unseeded} assume !!(main_~c~0 > 0); {1257#unseeded} is VALID [2020-07-29 01:30:15,677 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1257#unseeded} is VALID [2020-07-29 01:30:15,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {1257#unseeded} assume !!(main_~c~0 > 0); {1257#unseeded} is VALID [2020-07-29 01:30:15,678 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1257#unseeded} is VALID [2020-07-29 01:30:15,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {1257#unseeded} assume !!(main_~c~0 > 0); {1257#unseeded} is VALID [2020-07-29 01:30:15,680 INFO L280 TraceCheckUtils]: 6: Hoare triple {1257#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1257#unseeded} is VALID [2020-07-29 01:30:15,681 INFO L280 TraceCheckUtils]: 7: Hoare triple {1257#unseeded} assume !!(main_~c~0 > 0); {1257#unseeded} is VALID [2020-07-29 01:30:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:15,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:30:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:15,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:15,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {1260#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1296#(<= ULTIMATE.start_main_~c~0 (+ oldRank0 1))} is VALID [2020-07-29 01:30:15,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {1296#(<= ULTIMATE.start_main_~c~0 (+ oldRank0 1))} assume !!(main_~c~0 > 0); {1296#(<= ULTIMATE.start_main_~c~0 (+ oldRank0 1))} is VALID [2020-07-29 01:30:15,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {1296#(<= ULTIMATE.start_main_~c~0 (+ oldRank0 1))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1260#(>= oldRank0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-29 01:30:15,806 INFO L280 TraceCheckUtils]: 3: Hoare triple {1260#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume !!(main_~c~0 > 0); {1260#(>= oldRank0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-29 01:30:15,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {1260#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1309#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} is VALID [2020-07-29 01:30:15,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {1309#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} assume !!(main_~c~0 > 0); {1270#(or (and (> oldRank0 ULTIMATE.start_main_~c~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:30:15,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:30:15,820 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:30:15,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:15,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,821 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:30:15,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-29 01:30:15,886 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 61 states and 87 transitions. Complement of second has 9 states. [2020-07-29 01:30:15,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:15,886 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:15,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:15,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:15,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:15,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:30:15,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:15,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:15,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:15,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 87 transitions. [2020-07-29 01:30:15,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:15,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:15,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:15,889 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:15,890 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:15,890 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:30:15,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:15,891 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:15,891 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 61 states and 87 transitions. cyclomatic complexity: 34 [2020-07-29 01:30:15,892 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:15,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:15,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:15,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 87 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:15,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:15,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:15,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 87 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:15,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:15,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:15,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 87 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:15,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:30:15,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:30:15,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 87 transitions. cyclomatic complexity: 34 Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:30:15,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:15,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:15,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 87 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:15,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:15,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 87 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:15,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:15,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:15,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 87 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:15,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:15,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:15,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 87 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:15,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,899 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:30:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-07-29 01:30:15,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:30:15,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:30:15,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:30:15,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:15,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. cyclomatic complexity: 34 [2020-07-29 01:30:15,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:15,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2020-07-29 01:30:15,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:30:15,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:30:15,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2020-07-29 01:30:15,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:15,905 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2020-07-29 01:30:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2020-07-29 01:30:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2020-07-29 01:30:15,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:15,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states and 75 transitions. Second operand 46 states. [2020-07-29 01:30:15,909 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states and 75 transitions. Second operand 46 states. [2020-07-29 01:30:15,910 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand 46 states. [2020-07-29 01:30:15,910 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:15,948 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-07-29 01:30:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2020-07-29 01:30:15,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:15,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:15,952 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 52 states and 75 transitions. [2020-07-29 01:30:15,952 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 52 states and 75 transitions. [2020-07-29 01:30:15,952 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:15,966 INFO L93 Difference]: Finished difference Result 94 states and 135 transitions. [2020-07-29 01:30:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2020-07-29 01:30:15,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:15,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:15,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:15,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-29 01:30:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2020-07-29 01:30:15,973 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2020-07-29 01:30:15,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:30:15,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:30:15,974 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2020-07-29 01:30:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:16,034 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-29 01:30:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:30:16,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:30:16,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:16,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2020-07-29 01:30:16,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:16,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2020-07-29 01:30:16,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2020-07-29 01:30:16,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2020-07-29 01:30:16,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2020-07-29 01:30:16,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:16,046 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-29 01:30:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2020-07-29 01:30:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2020-07-29 01:30:16,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:16,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 36 transitions. Second operand 21 states. [2020-07-29 01:30:16,049 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 36 transitions. Second operand 21 states. [2020-07-29 01:30:16,049 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 21 states. [2020-07-29 01:30:16,049 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:16,051 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2020-07-29 01:30:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2020-07-29 01:30:16,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:16,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:16,052 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 27 states and 36 transitions. [2020-07-29 01:30:16,052 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 27 states and 36 transitions. [2020-07-29 01:30:16,053 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:16,054 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2020-07-29 01:30:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2020-07-29 01:30:16,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:16,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:16,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:16,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:30:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-07-29 01:30:16,056 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 01:30:16,057 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 01:30:16,057 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:30:16,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-07-29 01:30:16,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:16,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:16,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:16,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2020-07-29 01:30:16,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2020-07-29 01:30:16,058 INFO L794 eck$LassoCheckResult]: Stem: 1710#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1711#L12-2 assume !!(main_~c~0 > 0); 1727#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1725#L12-2 assume !!(main_~c~0 > 0); 1718#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1713#L12-2 assume !!(main_~c~0 > 0); 1719#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1717#L12-2 assume !!(main_~c~0 > 0); 1716#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1715#L12-2 assume !!(main_~c~0 > 0); 1712#L12 [2020-07-29 01:30:16,059 INFO L796 eck$LassoCheckResult]: Loop: 1712#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1713#L12-2 assume !!(main_~c~0 > 0); 1719#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1717#L12-2 assume !!(main_~c~0 > 0); 1716#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1715#L12-2 assume !!(main_~c~0 > 0); 1712#L12 [2020-07-29 01:30:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2020-07-29 01:30:16,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:16,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426260379] [2020-07-29 01:30:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:16,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:16,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:16,074 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2020-07-29 01:30:16,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:16,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795767432] [2020-07-29 01:30:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:16,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:16,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:16,086 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:16,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:16,086 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2020-07-29 01:30:16,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:16,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386365264] [2020-07-29 01:30:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:16,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {1836#true} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {1836#true} is VALID [2020-07-29 01:30:16,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {1836#true} assume !!(main_~c~0 > 0); {1836#true} is VALID [2020-07-29 01:30:16,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {1836#true} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1836#true} is VALID [2020-07-29 01:30:16,154 INFO L280 TraceCheckUtils]: 3: Hoare triple {1836#true} assume !!(main_~c~0 > 0); {1836#true} is VALID [2020-07-29 01:30:16,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {1836#true} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1838#(<= ULTIMATE.start_main_~x~0 111)} is VALID [2020-07-29 01:30:16,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {1838#(<= ULTIMATE.start_main_~x~0 111)} assume !!(main_~c~0 > 0); {1838#(<= ULTIMATE.start_main_~x~0 111)} is VALID [2020-07-29 01:30:16,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {1838#(<= ULTIMATE.start_main_~x~0 111)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1839#(<= ULTIMATE.start_main_~x~0 101)} is VALID [2020-07-29 01:30:16,158 INFO L280 TraceCheckUtils]: 7: Hoare triple {1839#(<= ULTIMATE.start_main_~x~0 101)} assume !!(main_~c~0 > 0); {1839#(<= ULTIMATE.start_main_~x~0 101)} is VALID [2020-07-29 01:30:16,159 INFO L280 TraceCheckUtils]: 8: Hoare triple {1839#(<= ULTIMATE.start_main_~x~0 101)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1840#(<= ULTIMATE.start_main_~x~0 91)} is VALID [2020-07-29 01:30:16,160 INFO L280 TraceCheckUtils]: 9: Hoare triple {1840#(<= ULTIMATE.start_main_~x~0 91)} assume !!(main_~c~0 > 0); {1840#(<= ULTIMATE.start_main_~x~0 91)} is VALID [2020-07-29 01:30:16,161 INFO L280 TraceCheckUtils]: 10: Hoare triple {1840#(<= ULTIMATE.start_main_~x~0 91)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1841#(<= ULTIMATE.start_main_~x~0 102)} is VALID [2020-07-29 01:30:16,161 INFO L280 TraceCheckUtils]: 11: Hoare triple {1841#(<= ULTIMATE.start_main_~x~0 102)} assume !!(main_~c~0 > 0); {1841#(<= ULTIMATE.start_main_~x~0 102)} is VALID [2020-07-29 01:30:16,162 INFO L280 TraceCheckUtils]: 12: Hoare triple {1841#(<= ULTIMATE.start_main_~x~0 102)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1842#(<= ULTIMATE.start_main_~x~0 92)} is VALID [2020-07-29 01:30:16,163 INFO L280 TraceCheckUtils]: 13: Hoare triple {1842#(<= ULTIMATE.start_main_~x~0 92)} assume !!(main_~c~0 > 0); {1842#(<= ULTIMATE.start_main_~x~0 92)} is VALID [2020-07-29 01:30:16,164 INFO L280 TraceCheckUtils]: 14: Hoare triple {1842#(<= ULTIMATE.start_main_~x~0 92)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1837#false} is VALID [2020-07-29 01:30:16,164 INFO L280 TraceCheckUtils]: 15: Hoare triple {1837#false} assume !!(main_~c~0 > 0); {1837#false} is VALID [2020-07-29 01:30:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:30:16,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386365264] [2020-07-29 01:30:16,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779696372] [2020-07-29 01:30:16,165 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:30:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:16,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:30:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:16,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:16,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {1836#true} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {1836#true} is VALID [2020-07-29 01:30:16,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {1836#true} assume !!(main_~c~0 > 0); {1836#true} is VALID [2020-07-29 01:30:16,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {1836#true} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1836#true} is VALID [2020-07-29 01:30:16,350 INFO L280 TraceCheckUtils]: 3: Hoare triple {1836#true} assume !!(main_~c~0 > 0); {1836#true} is VALID [2020-07-29 01:30:16,352 INFO L280 TraceCheckUtils]: 4: Hoare triple {1836#true} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1838#(<= ULTIMATE.start_main_~x~0 111)} is VALID [2020-07-29 01:30:16,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {1838#(<= ULTIMATE.start_main_~x~0 111)} assume !!(main_~c~0 > 0); {1838#(<= ULTIMATE.start_main_~x~0 111)} is VALID [2020-07-29 01:30:16,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {1838#(<= ULTIMATE.start_main_~x~0 111)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1839#(<= ULTIMATE.start_main_~x~0 101)} is VALID [2020-07-29 01:30:16,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {1839#(<= ULTIMATE.start_main_~x~0 101)} assume !!(main_~c~0 > 0); {1839#(<= ULTIMATE.start_main_~x~0 101)} is VALID [2020-07-29 01:30:16,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {1839#(<= ULTIMATE.start_main_~x~0 101)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1840#(<= ULTIMATE.start_main_~x~0 91)} is VALID [2020-07-29 01:30:16,356 INFO L280 TraceCheckUtils]: 9: Hoare triple {1840#(<= ULTIMATE.start_main_~x~0 91)} assume !!(main_~c~0 > 0); {1840#(<= ULTIMATE.start_main_~x~0 91)} is VALID [2020-07-29 01:30:16,358 INFO L280 TraceCheckUtils]: 10: Hoare triple {1840#(<= ULTIMATE.start_main_~x~0 91)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1841#(<= ULTIMATE.start_main_~x~0 102)} is VALID [2020-07-29 01:30:16,358 INFO L280 TraceCheckUtils]: 11: Hoare triple {1841#(<= ULTIMATE.start_main_~x~0 102)} assume !!(main_~c~0 > 0); {1841#(<= ULTIMATE.start_main_~x~0 102)} is VALID [2020-07-29 01:30:16,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {1841#(<= ULTIMATE.start_main_~x~0 102)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1842#(<= ULTIMATE.start_main_~x~0 92)} is VALID [2020-07-29 01:30:16,360 INFO L280 TraceCheckUtils]: 13: Hoare triple {1842#(<= ULTIMATE.start_main_~x~0 92)} assume !!(main_~c~0 > 0); {1842#(<= ULTIMATE.start_main_~x~0 92)} is VALID [2020-07-29 01:30:16,362 INFO L280 TraceCheckUtils]: 14: Hoare triple {1842#(<= ULTIMATE.start_main_~x~0 92)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1837#false} is VALID [2020-07-29 01:30:16,362 INFO L280 TraceCheckUtils]: 15: Hoare triple {1837#false} assume !!(main_~c~0 > 0); {1837#false} is VALID [2020-07-29 01:30:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:30:16,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:30:16,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-29 01:30:16,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145443473] [2020-07-29 01:30:16,425 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:16,425 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:16,426 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:16,426 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:16,426 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:16,426 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:16,426 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:16,426 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:16,426 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2020-07-29 01:30:16,427 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:16,427 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:16,433 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:30:16,437 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:30:16,446 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:30:16,453 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:30:16,551 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:16,552 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:16,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:16,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:16,559 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:16,559 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:16,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:16,581 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:16,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:16,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:16,609 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:16,628 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:16,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:16,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:16,629 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:16,629 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:16,629 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:16,629 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:16,629 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:16,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2020-07-29 01:30:16,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:16,630 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:16,635 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:30:16,639 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:30:16,648 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:30:16,654 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:30:16,762 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:16,762 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:16,766 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:30:16,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:16,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:16,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:16,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:16,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:16,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:16,773 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:16,808 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:30:16,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:16,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:16,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:16,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:16,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:16,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:16,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:16,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:16,815 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:30:16,815 INFO L444 ModelExtractionUtils]: 1 out of 3 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:16,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:16,819 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:16,819 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:16,819 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:30:16,842 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:16,845 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" [2020-07-29 01:30:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:16,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:16,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:16,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {1888#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {1888#unseeded} is VALID [2020-07-29 01:30:16,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:16,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {1888#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1888#unseeded} is VALID [2020-07-29 01:30:16,879 INFO L280 TraceCheckUtils]: 3: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:16,880 INFO L280 TraceCheckUtils]: 4: Hoare triple {1888#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1888#unseeded} is VALID [2020-07-29 01:30:16,880 INFO L280 TraceCheckUtils]: 5: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:16,881 INFO L280 TraceCheckUtils]: 6: Hoare triple {1888#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1888#unseeded} is VALID [2020-07-29 01:30:16,881 INFO L280 TraceCheckUtils]: 7: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:16,882 INFO L280 TraceCheckUtils]: 8: Hoare triple {1888#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1888#unseeded} is VALID [2020-07-29 01:30:16,882 INFO L280 TraceCheckUtils]: 9: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:16,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:30:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:16,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:17,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {1891#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1933#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} is VALID [2020-07-29 01:30:17,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {1933#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} assume !!(main_~c~0 > 0); {1933#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} is VALID [2020-07-29 01:30:17,007 INFO L280 TraceCheckUtils]: 2: Hoare triple {1933#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1940#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} is VALID [2020-07-29 01:30:17,008 INFO L280 TraceCheckUtils]: 3: Hoare triple {1940#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} assume !!(main_~c~0 > 0); {1940#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} is VALID [2020-07-29 01:30:17,011 INFO L280 TraceCheckUtils]: 4: Hoare triple {1940#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1947#(and (<= 100 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:17,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {1947#(and (<= 100 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {1901#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:17,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:30:17,033 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:30:17,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,034 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:30:17,034 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-07-29 01:30:17,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2020-07-29 01:30:17,068 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:30:17,069 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:17,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:30:17,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:17,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:17,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:30:17,070 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:17,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:17,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 56 transitions. [2020-07-29 01:30:17,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:17,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:17,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:17,071 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:30:17,072 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:17,072 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:30:17,072 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:17,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 6 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:17,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:17,072 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:17,073 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 56 transitions. cyclomatic complexity: 15 [2020-07-29 01:30:17,073 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:17,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:30:17,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:30:17,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:30:17,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:17,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:17,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:17,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:17,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:17,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:17,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,078 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:30:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2020-07-29 01:30:17,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,079 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:17,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:17,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:17,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {1888#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {1888#unseeded} is VALID [2020-07-29 01:30:17,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {1888#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1888#unseeded} is VALID [2020-07-29 01:30:17,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,122 INFO L280 TraceCheckUtils]: 4: Hoare triple {1888#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1888#unseeded} is VALID [2020-07-29 01:30:17,122 INFO L280 TraceCheckUtils]: 5: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {1888#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1888#unseeded} is VALID [2020-07-29 01:30:17,123 INFO L280 TraceCheckUtils]: 7: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {1888#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1888#unseeded} is VALID [2020-07-29 01:30:17,124 INFO L280 TraceCheckUtils]: 9: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:17,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:30:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:17,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:17,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {1891#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2037#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} is VALID [2020-07-29 01:30:17,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {2037#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} assume !!(main_~c~0 > 0); {2037#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} is VALID [2020-07-29 01:30:17,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {2037#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {2044#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} is VALID [2020-07-29 01:30:17,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {2044#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} assume !!(main_~c~0 > 0); {2044#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} is VALID [2020-07-29 01:30:17,255 INFO L280 TraceCheckUtils]: 4: Hoare triple {2044#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {2051#(and (<= 100 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:17,256 INFO L280 TraceCheckUtils]: 5: Hoare triple {2051#(and (<= 100 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {1901#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:17,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:30:17,265 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:30:17,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,267 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:30:17,267 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-07-29 01:30:17,303 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2020-07-29 01:30:17,303 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:30:17,303 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:17,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:30:17,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:17,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:17,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:30:17,304 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:17,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:17,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 56 transitions. [2020-07-29 01:30:17,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:30:17,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:17,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:17,306 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:30:17,306 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:17,306 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:30:17,306 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:17,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 6 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:17,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:17,306 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:17,307 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 56 transitions. cyclomatic complexity: 15 [2020-07-29 01:30:17,307 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:17,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:30:17,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:30:17,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:30:17,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:17,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:17,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:17,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:17,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:17,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:17,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 56 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,311 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:30:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2020-07-29 01:30:17,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,312 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:17,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:17,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:17,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {1888#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {1888#unseeded} is VALID [2020-07-29 01:30:17,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {1888#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1888#unseeded} is VALID [2020-07-29 01:30:17,357 INFO L280 TraceCheckUtils]: 3: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {1888#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {1888#unseeded} is VALID [2020-07-29 01:30:17,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,358 INFO L280 TraceCheckUtils]: 6: Hoare triple {1888#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1888#unseeded} is VALID [2020-07-29 01:30:17,365 INFO L280 TraceCheckUtils]: 7: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,366 INFO L280 TraceCheckUtils]: 8: Hoare triple {1888#unseeded} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {1888#unseeded} is VALID [2020-07-29 01:30:17,366 INFO L280 TraceCheckUtils]: 9: Hoare triple {1888#unseeded} assume !!(main_~c~0 > 0); {1888#unseeded} is VALID [2020-07-29 01:30:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:17,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:30:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:17,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:17,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {1891#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2141#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} is VALID [2020-07-29 01:30:17,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {2141#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} assume !!(main_~c~0 > 0); {2141#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} is VALID [2020-07-29 01:30:17,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {2141#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 11))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {2148#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} is VALID [2020-07-29 01:30:17,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {2148#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} assume !!(main_~c~0 > 0); {2148#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} is VALID [2020-07-29 01:30:17,495 INFO L280 TraceCheckUtils]: 4: Hoare triple {2148#(<= ULTIMATE.start_main_~x~0 (+ oldRank0 1))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {2155#(and (<= 100 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:17,496 INFO L280 TraceCheckUtils]: 5: Hoare triple {2155#(and (<= 100 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {1901#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:17,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:30:17,508 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:30:17,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,509 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 4 loop predicates [2020-07-29 01:30:17,509 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-07-29 01:30:17,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2020-07-29 01:30:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:17,562 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:17,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:30:17,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:17,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:17,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:30:17,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:17,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:17,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:17,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 99 transitions. [2020-07-29 01:30:17,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-07-29 01:30:17,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:17,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:17,565 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:30:17,565 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:17,565 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:30:17,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:17,566 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:17,566 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 75 states and 99 transitions. cyclomatic complexity: 28 [2020-07-29 01:30:17,566 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:17,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:17,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:17,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:17,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 14 letters. [2020-07-29 01:30:17,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 14 letters. [2020-07-29 01:30:17,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 14 letters. [2020-07-29 01:30:17,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:30:17,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:30:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:30:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:17,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:17,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:17,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:17,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:17,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:17,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 14 letters. [2020-07-29 01:30:17,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 14 letters. [2020-07-29 01:30:17,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 14 letters. [2020-07-29 01:30:17,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:17,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:17,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 99 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:17,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,575 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:30:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-29 01:30:17,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:30:17,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2020-07-29 01:30:17,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:30:17,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:17,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. cyclomatic complexity: 28 [2020-07-29 01:30:17,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-07-29 01:30:17,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2020-07-29 01:30:17,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:30:17,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:30:17,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2020-07-29 01:30:17,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:17,580 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2020-07-29 01:30:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2020-07-29 01:30:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2020-07-29 01:30:17,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:17,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states and 71 transitions. Second operand 40 states. [2020-07-29 01:30:17,584 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states and 71 transitions. Second operand 40 states. [2020-07-29 01:30:17,584 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 40 states. [2020-07-29 01:30:17,584 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:17,586 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2020-07-29 01:30:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2020-07-29 01:30:17,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:17,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:17,587 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 52 states and 71 transitions. [2020-07-29 01:30:17,587 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 52 states and 71 transitions. [2020-07-29 01:30:17,588 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:17,590 INFO L93 Difference]: Finished difference Result 84 states and 119 transitions. [2020-07-29 01:30:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2020-07-29 01:30:17,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:17,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:17,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:17,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:30:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2020-07-29 01:30:17,592 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2020-07-29 01:30:17,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:30:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:30:17,593 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2020-07-29 01:30:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:17,658 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2020-07-29 01:30:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:30:17,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:30:17,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:17,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2020-07-29 01:30:17,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-07-29 01:30:17,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2020-07-29 01:30:17,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2020-07-29 01:30:17,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:30:17,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2020-07-29 01:30:17,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:17,683 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2020-07-29 01:30:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2020-07-29 01:30:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2020-07-29 01:30:17,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:17,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states and 67 transitions. Second operand 33 states. [2020-07-29 01:30:17,686 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states and 67 transitions. Second operand 33 states. [2020-07-29 01:30:17,686 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand 33 states. [2020-07-29 01:30:17,686 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:17,688 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2020-07-29 01:30:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2020-07-29 01:30:17,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:17,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:17,688 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 51 states and 67 transitions. [2020-07-29 01:30:17,688 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 51 states and 67 transitions. [2020-07-29 01:30:17,688 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:17,690 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2020-07-29 01:30:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2020-07-29 01:30:17,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:17,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:17,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:17,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 01:30:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2020-07-29 01:30:17,692 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-07-29 01:30:17,692 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-07-29 01:30:17,692 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:30:17,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2020-07-29 01:30:17,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 01:30:17,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:17,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:17,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-29 01:30:17,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2020-07-29 01:30:17,693 INFO L794 eck$LassoCheckResult]: Stem: 2576#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 2578#L12-2 assume !!(main_~c~0 > 0); 2592#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2587#L12-2 assume !!(main_~c~0 > 0); 2583#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2584#L12-2 [2020-07-29 01:30:17,693 INFO L796 eck$LassoCheckResult]: Loop: 2584#L12-2 assume !!(main_~c~0 > 0); 2581#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2582#L12-2 assume !!(main_~c~0 > 0); 2586#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2572#L12-2 assume !!(main_~c~0 > 0); 2573#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2579#L12-2 assume !!(main_~c~0 > 0); 2583#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2584#L12-2 [2020-07-29 01:30:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:17,694 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2020-07-29 01:30:17,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:17,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907621880] [2020-07-29 01:30:17,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:17,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:17,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:17,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:17,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:17,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2020-07-29 01:30:17,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:17,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696247425] [2020-07-29 01:30:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:17,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {2754#true} assume !!(main_~c~0 > 0); {2754#true} is VALID [2020-07-29 01:30:17,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {2754#true} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {2754#true} is VALID [2020-07-29 01:30:17,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {2754#true} assume !!(main_~c~0 > 0); {2754#true} is VALID [2020-07-29 01:30:17,744 INFO L280 TraceCheckUtils]: 3: Hoare triple {2754#true} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {2756#(<= 91 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:17,744 INFO L280 TraceCheckUtils]: 4: Hoare triple {2756#(<= 91 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {2756#(<= 91 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:17,745 INFO L280 TraceCheckUtils]: 5: Hoare triple {2756#(<= 91 ULTIMATE.start_main_~x~0)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2757#(<= 102 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:17,746 INFO L280 TraceCheckUtils]: 6: Hoare triple {2757#(<= 102 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {2757#(<= 102 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:17,746 INFO L280 TraceCheckUtils]: 7: Hoare triple {2757#(<= 102 ULTIMATE.start_main_~x~0)} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2755#false} is VALID [2020-07-29 01:30:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:30:17,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696247425] [2020-07-29 01:30:17,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:30:17,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:30:17,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905600081] [2020-07-29 01:30:17,748 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:30:17,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:30:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:30:17,748 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2020-07-29 01:30:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:17,777 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2020-07-29 01:30:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:30:17,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:17,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:17,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2020-07-29 01:30:17,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:30:17,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2020-07-29 01:30:17,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:30:17,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:30:17,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2020-07-29 01:30:17,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:17,794 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2020-07-29 01:30:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2020-07-29 01:30:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2020-07-29 01:30:17,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:17,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 47 transitions. Second operand 33 states. [2020-07-29 01:30:17,796 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 47 transitions. Second operand 33 states. [2020-07-29 01:30:17,796 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 33 states. [2020-07-29 01:30:17,796 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:17,798 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2020-07-29 01:30:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2020-07-29 01:30:17,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:17,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:17,799 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 39 states and 47 transitions. [2020-07-29 01:30:17,799 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 39 states and 47 transitions. [2020-07-29 01:30:17,799 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:17,800 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2020-07-29 01:30:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2020-07-29 01:30:17,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:17,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:17,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:17,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 01:30:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2020-07-29 01:30:17,802 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-07-29 01:30:17,802 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-07-29 01:30:17,802 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:30:17,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2020-07-29 01:30:17,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:30:17,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:17,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:17,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-29 01:30:17,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2020-07-29 01:30:17,803 INFO L794 eck$LassoCheckResult]: Stem: 2813#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 2815#L12-2 assume !!(main_~c~0 > 0); 2829#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2828#L12-2 assume !!(main_~c~0 > 0); 2821#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2809#L12-2 [2020-07-29 01:30:17,803 INFO L796 eck$LassoCheckResult]: Loop: 2809#L12-2 assume !!(main_~c~0 > 0); 2810#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2819#L12-2 assume !!(main_~c~0 > 0); 2826#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2823#L12-2 assume !!(main_~c~0 > 0); 2816#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2817#L12-2 assume !!(main_~c~0 > 0); 2827#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2824#L12-2 assume !!(main_~c~0 > 0); 2820#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2809#L12-2 [2020-07-29 01:30:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2020-07-29 01:30:17,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:17,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552983938] [2020-07-29 01:30:17,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:17,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:17,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:17,816 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:17,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:17,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2020-07-29 01:30:17,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:17,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508332584] [2020-07-29 01:30:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:17,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:17,843 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:17,847 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2020-07-29 01:30:17,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:17,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743798902] [2020-07-29 01:30:17,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:17,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:17,881 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:17,885 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:17,998 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:17,998 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:17,999 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:17,999 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:17,999 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:17,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:17,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:17,999 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:18,000 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2020-07-29 01:30:18,000 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:18,000 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:18,006 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:30:18,010 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:30:18,018 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:30:18,024 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:30:18,125 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:18,125 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:18,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:18,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:18,132 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:18,133 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:18,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:18,162 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:18,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:18,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:18,212 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:18,213 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:18,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:18,214 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:18,214 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:18,214 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:18,214 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:18,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:18,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:18,214 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2020-07-29 01:30:18,214 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:18,214 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:18,220 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:30:18,224 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:30:18,233 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:30:18,237 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:30:18,346 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:18,347 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:18,350 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:30:18,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:18,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:18,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:18,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:18,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:18,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:18,355 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:18,377 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:30:18,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:18,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:18,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:18,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:18,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:18,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:18,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:18,385 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:18,387 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:18,388 INFO L444 ModelExtractionUtils]: 0 out of 3 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 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:18,391 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:18,391 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:18,391 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:18,391 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:30:18,413 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:18,416 INFO L393 LassoCheck]: Loop: "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" [2020-07-29 01:30:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:18,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:18,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:18,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:18,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {2997#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {2997#unseeded} is VALID [2020-07-29 01:30:18,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:18,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:18,455 INFO L280 TraceCheckUtils]: 3: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:18,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:18,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:30:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:18,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:18,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:18,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3030#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:18,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {3030#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {3030#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:18,705 INFO L280 TraceCheckUtils]: 3: Hoare triple {3030#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3037#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:18,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {3037#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {3037#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:18,706 INFO L280 TraceCheckUtils]: 5: Hoare triple {3037#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3044#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:18,707 INFO L280 TraceCheckUtils]: 6: Hoare triple {3044#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {3044#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:18,708 INFO L280 TraceCheckUtils]: 7: Hoare triple {3044#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3051#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:18,708 INFO L280 TraceCheckUtils]: 8: Hoare triple {3051#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {3051#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:18,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {3051#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3010#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:18,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:30:18,760 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:30:18,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,761 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:30:18,761 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 01:30:18,781 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2020-07-29 01:30:18,781 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:30:18,781 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:18,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:18,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:18,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:18,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:30:18,781 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:18,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:18,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2020-07-29 01:30:18,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:30:18,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:18,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:18,782 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:18,783 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:18,784 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:30:18,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:18,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:18,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:18,784 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:18,784 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 47 transitions. cyclomatic complexity: 14 [2020-07-29 01:30:18,786 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:18,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:30:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:30:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:30:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,801 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-07-29 01:30:18,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,802 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:18,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:18,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:18,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:18,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {2997#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {2997#unseeded} is VALID [2020-07-29 01:30:18,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:18,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:18,824 INFO L280 TraceCheckUtils]: 3: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:18,824 INFO L280 TraceCheckUtils]: 4: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:18,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:30:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:18,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:18,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:18,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3121#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:18,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {3121#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {3121#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:18,999 INFO L280 TraceCheckUtils]: 3: Hoare triple {3121#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3128#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:19,000 INFO L280 TraceCheckUtils]: 4: Hoare triple {3128#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {3128#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:19,001 INFO L280 TraceCheckUtils]: 5: Hoare triple {3128#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3135#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:19,003 INFO L280 TraceCheckUtils]: 6: Hoare triple {3135#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {3135#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:19,004 INFO L280 TraceCheckUtils]: 7: Hoare triple {3135#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3142#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:19,005 INFO L280 TraceCheckUtils]: 8: Hoare triple {3142#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {3142#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:19,007 INFO L280 TraceCheckUtils]: 9: Hoare triple {3142#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3010#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:19,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:30:19,023 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:30:19,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,023 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:30:19,024 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 01:30:19,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2020-07-29 01:30:19,043 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:30:19,044 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:19,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:19,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:19,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:19,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:30:19,044 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:19,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:19,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2020-07-29 01:30:19,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:30:19,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:19,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:19,045 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:19,046 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:19,046 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:30:19,046 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:19,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:19,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:19,046 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:19,046 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 47 transitions. cyclomatic complexity: 14 [2020-07-29 01:30:19,047 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:19,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:30:19,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:30:19,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:30:19,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:19,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:19,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:19,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:19,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:19,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:19,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,061 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-07-29 01:30:19,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,062 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:19,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:19,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {2997#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {2997#unseeded} is VALID [2020-07-29 01:30:19,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:19,091 INFO L280 TraceCheckUtils]: 2: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:19,093 INFO L280 TraceCheckUtils]: 3: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:19,097 INFO L280 TraceCheckUtils]: 4: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:30:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:19,269 INFO L280 TraceCheckUtils]: 0: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:19,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3212#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:19,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {3212#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {3212#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:19,272 INFO L280 TraceCheckUtils]: 3: Hoare triple {3212#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3219#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:19,272 INFO L280 TraceCheckUtils]: 4: Hoare triple {3219#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {3219#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:19,273 INFO L280 TraceCheckUtils]: 5: Hoare triple {3219#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3226#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:19,274 INFO L280 TraceCheckUtils]: 6: Hoare triple {3226#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {3226#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:19,275 INFO L280 TraceCheckUtils]: 7: Hoare triple {3226#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3233#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:19,276 INFO L280 TraceCheckUtils]: 8: Hoare triple {3233#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {3233#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:19,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {3233#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3010#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:19,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:30:19,291 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:30:19,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,292 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 5 loop predicates [2020-07-29 01:30:19,292 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 01:30:19,324 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2020-07-29 01:30:19,324 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:30:19,324 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:19,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:19,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:19,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:19,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:30:19,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:19,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:19,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:19,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 60 transitions. [2020-07-29 01:30:19,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:30:19,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:19,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:19,327 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:19,327 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:19,327 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:30:19,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:19,327 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:19,327 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:30:19,328 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:19,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:19,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:19,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:19,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:30:19,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:30:19,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:30:19,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:19,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:19,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:19,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:19,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:19,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:19,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:19,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:19,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:19,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 60 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,342 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:30:19,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,343 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:19,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {2997#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {2997#unseeded} is VALID [2020-07-29 01:30:19,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:19,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:19,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:19,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:30:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:19,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:19,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3311#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:19,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {3311#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {3311#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:19,563 INFO L280 TraceCheckUtils]: 3: Hoare triple {3311#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3318#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:19,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {3318#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {3318#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:19,565 INFO L280 TraceCheckUtils]: 5: Hoare triple {3318#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3325#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:19,565 INFO L280 TraceCheckUtils]: 6: Hoare triple {3325#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {3325#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:19,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {3325#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3332#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:19,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {3332#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {3332#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:19,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {3332#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3010#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:19,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:30:19,583 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:30:19,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,584 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:30:19,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 01:30:19,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2020-07-29 01:30:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:19,639 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:19,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:19,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:19,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:19,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:30:19,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:19,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:19,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:19,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 75 transitions. [2020-07-29 01:30:19,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:30:19,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:19,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:19,641 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:19,642 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:19,642 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:30:19,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:19,642 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:19,642 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 75 transitions. cyclomatic complexity: 16 [2020-07-29 01:30:19,643 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:19,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:19,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:19,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:19,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:30:19,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:30:19,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:30:19,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:19,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:19,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:19,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:19,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:19,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:19,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:19,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:19,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:19,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:19,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:19,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:19,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:19,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:19,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,661 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2020-07-29 01:30:19,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,664 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:19,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {2997#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {2997#unseeded} is VALID [2020-07-29 01:30:19,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:19,688 INFO L280 TraceCheckUtils]: 2: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:19,688 INFO L280 TraceCheckUtils]: 3: Hoare triple {2997#unseeded} assume !!(main_~c~0 > 0); {2997#unseeded} is VALID [2020-07-29 01:30:19,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {2997#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {2997#unseeded} is VALID [2020-07-29 01:30:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:30:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:19,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:19,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {3000#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3433#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:19,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {3433#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:19,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {3433#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3440#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:19,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {3440#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {3440#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:19,890 INFO L280 TraceCheckUtils]: 5: Hoare triple {3440#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3447#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:19,891 INFO L280 TraceCheckUtils]: 6: Hoare triple {3447#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {3447#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:19,892 INFO L280 TraceCheckUtils]: 7: Hoare triple {3447#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {3454#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:19,892 INFO L280 TraceCheckUtils]: 8: Hoare triple {3454#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {3454#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:19,893 INFO L280 TraceCheckUtils]: 9: Hoare triple {3454#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {3010#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:19,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:30:19,908 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:30:19,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:19,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:19,909 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:30:19,909 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 01:30:19,991 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:19,992 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:19,992 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:19,992 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:19,994 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:20,056 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:20,056 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:20,057 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:20,057 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:20,057 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:20,057 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:20,058 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:20,058 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:20,086 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2020-07-29 01:30:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:20,086 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2020-07-29 01:30:20,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:20,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:20,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:20,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:30:20,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:30:20,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:20,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:20,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 404 states and 547 transitions. [2020-07-29 01:30:20,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-07-29 01:30:20,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:20,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:20,091 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:20,091 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:20,092 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:30:20,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:30:20,092 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:20,092 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 404 states and 547 transitions. cyclomatic complexity: 152 [2020-07-29 01:30:20,093 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:20,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:20,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:20,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:20,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:20,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:20,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:20,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 404 letters. Loop has 404 letters. [2020-07-29 01:30:20,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 404 letters. Loop has 404 letters. [2020-07-29 01:30:20,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 404 letters. Loop has 404 letters. [2020-07-29 01:30:20,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:20,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:20,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:30:20,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:20,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:20,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:20,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:20,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:20,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:20,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:20,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:20,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:30:20,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:20,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:20,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:20,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:20,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:20,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:30:20,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:20,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:20,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:20,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:20,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:20,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:30:20,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:20,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:20,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:30:20,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:20,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:20,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:20,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:20,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:20,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:20,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 404 states and 547 transitions. cyclomatic complexity: 152 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,166 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2020-07-29 01:30:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-29 01:30:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:30:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2020-07-29 01:30:20,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2020-07-29 01:30:20,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:20,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. cyclomatic complexity: 152 [2020-07-29 01:30:20,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-07-29 01:30:20,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2020-07-29 01:30:20,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:30:20,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:30:20,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2020-07-29 01:30:20,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:20,188 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2020-07-29 01:30:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2020-07-29 01:30:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2020-07-29 01:30:20,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:20,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states and 187 transitions. Second operand 96 states. [2020-07-29 01:30:20,196 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states and 187 transitions. Second operand 96 states. [2020-07-29 01:30:20,196 INFO L87 Difference]: Start difference. First operand 145 states and 187 transitions. Second operand 96 states. [2020-07-29 01:30:20,197 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:20,200 INFO L93 Difference]: Finished difference Result 178 states and 230 transitions. [2020-07-29 01:30:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 230 transitions. [2020-07-29 01:30:20,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:20,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:20,202 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 145 states and 187 transitions. [2020-07-29 01:30:20,202 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 145 states and 187 transitions. [2020-07-29 01:30:20,202 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:20,211 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2020-07-29 01:30:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2020-07-29 01:30:20,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:20,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:20,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:20,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-29 01:30:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2020-07-29 01:30:20,215 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2020-07-29 01:30:20,215 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2020-07-29 01:30:20,216 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:30:20,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2020-07-29 01:30:20,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-29 01:30:20,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:20,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:20,217 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-29 01:30:20,217 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2020-07-29 01:30:20,218 INFO L794 eck$LassoCheckResult]: Stem: 3960#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3963#L12-2 assume !!(main_~c~0 > 0); 3987#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 3983#L12-2 assume !!(main_~c~0 > 0); 3969#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 3956#L12-2 [2020-07-29 01:30:20,218 INFO L796 eck$LassoCheckResult]: Loop: 3956#L12-2 assume !!(main_~c~0 > 0); 3957#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4018#L12-2 assume !!(main_~c~0 > 0); 4011#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4009#L12-2 assume !!(main_~c~0 > 0); 4003#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 4002#L12-2 assume !!(main_~c~0 > 0); 4001#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3993#L12-2 assume !!(main_~c~0 > 0); 3972#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 3984#L12-2 assume !!(main_~c~0 > 0); 3982#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3980#L12-2 assume !!(main_~c~0 > 0); 3968#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 3956#L12-2 [2020-07-29 01:30:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2020-07-29 01:30:20,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:20,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251800938] [2020-07-29 01:30:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:20,225 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:20,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:20,229 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2020-07-29 01:30:20,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:20,230 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781252194] [2020-07-29 01:30:20,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:20,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:20,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:20,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2020-07-29 01:30:20,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:20,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540027909] [2020-07-29 01:30:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:20,291 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:20,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:20,305 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:20,426 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2020-07-29 01:30:20,458 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:20,459 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:20,459 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:20,459 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:20,459 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:20,459 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:20,459 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:20,459 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:20,459 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2020-07-29 01:30:20,460 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:20,460 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:20,468 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:30:20,476 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:30:20,482 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:30:20,486 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:30:20,582 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:20,583 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:20,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:20,585 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:20,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:20,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:20,613 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:20,634 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:20,634 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:20,634 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:20,634 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:20,634 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:20,634 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:20,634 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:20,634 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:20,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2020-07-29 01:30:20,635 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:20,635 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:20,642 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:30:20,657 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:30:20,663 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:30:20,667 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:30:20,769 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:20,770 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:20,772 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:30:20,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:20,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:20,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:20,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:20,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:20,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:20,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:20,778 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:20,780 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:30:20,780 INFO L444 ModelExtractionUtils]: 1 out of 3 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:20,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:20,782 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:20,783 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:20,783 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:30:20,803 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:20,805 INFO L393 LassoCheck]: Loop: "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" [2020-07-29 01:30:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:20,834 INFO L280 TraceCheckUtils]: 0: Hoare triple {4424#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {4424#unseeded} is VALID [2020-07-29 01:30:20,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:20,835 INFO L280 TraceCheckUtils]: 2: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:20,836 INFO L280 TraceCheckUtils]: 3: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:20,837 INFO L280 TraceCheckUtils]: 4: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:30:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:20,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:21,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:21,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4457#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:21,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {4457#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {4457#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:21,137 INFO L280 TraceCheckUtils]: 3: Hoare triple {4457#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4464#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:21,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {4464#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {4464#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:21,139 INFO L280 TraceCheckUtils]: 5: Hoare triple {4464#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4471#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:21,140 INFO L280 TraceCheckUtils]: 6: Hoare triple {4471#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {4471#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:21,142 INFO L280 TraceCheckUtils]: 7: Hoare triple {4471#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4478#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:21,142 INFO L280 TraceCheckUtils]: 8: Hoare triple {4478#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {4478#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:21,143 INFO L280 TraceCheckUtils]: 9: Hoare triple {4478#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4485#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:21,144 INFO L280 TraceCheckUtils]: 10: Hoare triple {4485#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume !!(main_~c~0 > 0); {4485#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:21,144 INFO L280 TraceCheckUtils]: 11: Hoare triple {4485#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4492#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:21,145 INFO L280 TraceCheckUtils]: 12: Hoare triple {4492#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !!(main_~c~0 > 0); {4492#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:21,146 INFO L280 TraceCheckUtils]: 13: Hoare triple {4492#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4437#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:21,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:30:21,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:21,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-07-29 01:30:21,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2020-07-29 01:30:21,195 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2020-07-29 01:30:21,195 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:30:21,195 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:21,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:21,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:21,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:21,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:30:21,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:21,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:21,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 145 transitions. [2020-07-29 01:30:21,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-29 01:30:21,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:21,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:21,199 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:21,200 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:21,200 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:30:21,201 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:21,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:21,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:21,201 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:21,202 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 104 states and 145 transitions. cyclomatic complexity: 50 [2020-07-29 01:30:21,202 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:21,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 104 letters. Loop has 104 letters. [2020-07-29 01:30:21,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 104 letters. Loop has 104 letters. [2020-07-29 01:30:21,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 104 letters. Loop has 104 letters. [2020-07-29 01:30:21,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:21,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:21,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:21,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:21,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:21,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:21,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,224 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:30:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-07-29 01:30:21,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,226 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:21,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:21,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:21,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {4424#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {4424#unseeded} is VALID [2020-07-29 01:30:21,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:21,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:21,252 INFO L280 TraceCheckUtils]: 3: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:21,253 INFO L280 TraceCheckUtils]: 4: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:21,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:30:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:21,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:21,609 INFO L280 TraceCheckUtils]: 0: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:21,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4629#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:21,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {4629#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {4629#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:21,612 INFO L280 TraceCheckUtils]: 3: Hoare triple {4629#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4636#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:21,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {4636#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {4636#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:21,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {4636#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4643#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:21,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {4643#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {4643#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:21,616 INFO L280 TraceCheckUtils]: 7: Hoare triple {4643#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4650#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:21,617 INFO L280 TraceCheckUtils]: 8: Hoare triple {4650#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {4650#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:21,618 INFO L280 TraceCheckUtils]: 9: Hoare triple {4650#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4657#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:21,619 INFO L280 TraceCheckUtils]: 10: Hoare triple {4657#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume !!(main_~c~0 > 0); {4657#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:21,620 INFO L280 TraceCheckUtils]: 11: Hoare triple {4657#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4664#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:21,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {4664#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !!(main_~c~0 > 0); {4664#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:21,622 INFO L280 TraceCheckUtils]: 13: Hoare triple {4664#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4437#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:21,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:30:21,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:21,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2020-07-29 01:30:21,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2020-07-29 01:30:21,661 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2020-07-29 01:30:21,662 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:30:21,662 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:21,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:21,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:21,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:21,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:30:21,663 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:21,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:21,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 145 transitions. [2020-07-29 01:30:21,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-29 01:30:21,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:21,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:21,665 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:21,665 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:21,665 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:30:21,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:21,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:21,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:21,665 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:21,666 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 104 states and 145 transitions. cyclomatic complexity: 50 [2020-07-29 01:30:21,668 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:21,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 104 letters. Loop has 104 letters. [2020-07-29 01:30:21,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 104 letters. Loop has 104 letters. [2020-07-29 01:30:21,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 104 letters. Loop has 104 letters. [2020-07-29 01:30:21,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:21,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:21,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:21,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:21,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:21,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:21,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:21,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:21,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 145 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,684 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:30:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-07-29 01:30:21,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:21,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:21,687 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:21,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:21,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:21,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {4424#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {4424#unseeded} is VALID [2020-07-29 01:30:21,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:21,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:21,711 INFO L280 TraceCheckUtils]: 3: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:21,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:21,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:30:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:21,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,000 INFO L280 TraceCheckUtils]: 0: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:22,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4801#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:22,002 INFO L280 TraceCheckUtils]: 2: Hoare triple {4801#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {4801#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:22,003 INFO L280 TraceCheckUtils]: 3: Hoare triple {4801#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4808#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:22,003 INFO L280 TraceCheckUtils]: 4: Hoare triple {4808#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {4808#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:22,004 INFO L280 TraceCheckUtils]: 5: Hoare triple {4808#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4815#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:22,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {4815#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {4815#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:22,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {4815#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4822#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:22,006 INFO L280 TraceCheckUtils]: 8: Hoare triple {4822#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {4822#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:22,007 INFO L280 TraceCheckUtils]: 9: Hoare triple {4822#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4829#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:22,009 INFO L280 TraceCheckUtils]: 10: Hoare triple {4829#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume !!(main_~c~0 > 0); {4829#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:22,010 INFO L280 TraceCheckUtils]: 11: Hoare triple {4829#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {4836#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:22,010 INFO L280 TraceCheckUtils]: 12: Hoare triple {4836#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !!(main_~c~0 > 0); {4836#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:22,011 INFO L280 TraceCheckUtils]: 13: Hoare triple {4836#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4437#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:22,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:30:22,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:22,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,032 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 7 loop predicates [2020-07-29 01:30:22,032 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2020-07-29 01:30:22,066 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2020-07-29 01:30:22,066 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:30:22,066 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:22,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:30:22,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:22,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 191 transitions. [2020-07-29 01:30:22,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-07-29 01:30:22,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,069 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:22,069 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:22,069 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:30:22,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:22,070 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,070 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 146 states and 191 transitions. cyclomatic complexity: 54 [2020-07-29 01:30:22,070 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:22,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:22,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:22,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:22,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 146 letters. Loop has 146 letters. [2020-07-29 01:30:22,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 146 letters. Loop has 146 letters. [2020-07-29 01:30:22,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 146 letters. Loop has 146 letters. [2020-07-29 01:30:22,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:22,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:22,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:22,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:22,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:22,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:22,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:22,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:22,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:22,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:22,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:22,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:22,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 146 states and 191 transitions. cyclomatic complexity: 54 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,086 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:30:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:30:22,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,087 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:22,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {4424#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {4424#unseeded} is VALID [2020-07-29 01:30:22,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:22,130 INFO L280 TraceCheckUtils]: 2: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:22,130 INFO L280 TraceCheckUtils]: 3: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:22,131 INFO L280 TraceCheckUtils]: 4: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:22,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {5014#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:22,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {5014#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {5014#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:22,422 INFO L280 TraceCheckUtils]: 3: Hoare triple {5014#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {5021#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:22,423 INFO L280 TraceCheckUtils]: 4: Hoare triple {5021#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {5021#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:22,424 INFO L280 TraceCheckUtils]: 5: Hoare triple {5021#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {5028#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:22,425 INFO L280 TraceCheckUtils]: 6: Hoare triple {5028#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {5028#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:22,426 INFO L280 TraceCheckUtils]: 7: Hoare triple {5028#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {5035#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:22,426 INFO L280 TraceCheckUtils]: 8: Hoare triple {5035#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {5035#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:22,427 INFO L280 TraceCheckUtils]: 9: Hoare triple {5035#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {5042#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:22,428 INFO L280 TraceCheckUtils]: 10: Hoare triple {5042#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume !!(main_~c~0 > 0); {5042#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:22,429 INFO L280 TraceCheckUtils]: 11: Hoare triple {5042#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {5049#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:22,430 INFO L280 TraceCheckUtils]: 12: Hoare triple {5049#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !!(main_~c~0 > 0); {5049#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:22,431 INFO L280 TraceCheckUtils]: 13: Hoare triple {5049#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4437#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:22,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:30:22,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:22,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,454 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2020-07-29 01:30:22,454 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2020-07-29 01:30:22,514 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2020-07-29 01:30:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:22,514 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:22,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:30:22,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:22,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172 states and 219 transitions. [2020-07-29 01:30:22,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-07-29 01:30:22,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:22,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:22,518 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:22,518 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:22,518 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:30:22,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:22,519 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:22,519 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 172 states and 219 transitions. cyclomatic complexity: 56 [2020-07-29 01:30:22,519 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:22,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:22,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:22,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:22,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 172 letters. Loop has 172 letters. [2020-07-29 01:30:22,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 172 letters. Loop has 172 letters. [2020-07-29 01:30:22,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 172 letters. Loop has 172 letters. [2020-07-29 01:30:22,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:22,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:22,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:22,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:22,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:22,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:22,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:22,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:22,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:22,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:22,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:22,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:22,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 172 states and 219 transitions. cyclomatic complexity: 56 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:22,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,541 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:30:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2020-07-29 01:30:22,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,543 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {4424#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {4424#unseeded} is VALID [2020-07-29 01:30:22,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:22,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:22,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {4424#unseeded} assume !!(main_~c~0 > 0); {4424#unseeded} is VALID [2020-07-29 01:30:22,573 INFO L280 TraceCheckUtils]: 4: Hoare triple {4424#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4424#unseeded} is VALID [2020-07-29 01:30:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:30:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:22,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:22,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~c~0 > 0); {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:30:22,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {4427#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {5259#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:22,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {5259#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume !!(main_~c~0 > 0); {5259#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} is VALID [2020-07-29 01:30:22,874 INFO L280 TraceCheckUtils]: 3: Hoare triple {5259#(<= (+ ULTIMATE.start_main_~x~0 10) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {5266#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:22,875 INFO L280 TraceCheckUtils]: 4: Hoare triple {5266#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !!(main_~c~0 > 0); {5266#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} is VALID [2020-07-29 01:30:22,876 INFO L280 TraceCheckUtils]: 5: Hoare triple {5266#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 20) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {5273#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:22,879 INFO L280 TraceCheckUtils]: 6: Hoare triple {5273#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume !!(main_~c~0 > 0); {5273#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} is VALID [2020-07-29 01:30:22,880 INFO L280 TraceCheckUtils]: 7: Hoare triple {5273#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 9) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {5280#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:22,881 INFO L280 TraceCheckUtils]: 8: Hoare triple {5280#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !!(main_~c~0 > 0); {5280#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} is VALID [2020-07-29 01:30:22,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {5280#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 19) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {5287#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:22,882 INFO L280 TraceCheckUtils]: 10: Hoare triple {5287#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume !!(main_~c~0 > 0); {5287#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} is VALID [2020-07-29 01:30:22,882 INFO L280 TraceCheckUtils]: 11: Hoare triple {5287#(and (<= (+ ULTIMATE.start_main_~x~0 8) oldRank0) (<= 111 oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {5294#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:22,883 INFO L280 TraceCheckUtils]: 12: Hoare triple {5294#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !!(main_~c~0 > 0); {5294#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} is VALID [2020-07-29 01:30:22,884 INFO L280 TraceCheckUtils]: 13: Hoare triple {5294#(and (<= 111 oldRank0) (<= (+ ULTIMATE.start_main_~x~0 18) oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {4437#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:22,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:30:22,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:22,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:22,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:22,905 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-07-29 01:30:22,905 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2020-07-29 01:30:23,009 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,010 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,011 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,011 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,012 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,012 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,012 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,012 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,014 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,015 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,015 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,015 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,081 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,082 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,082 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,082 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,085 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,085 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,086 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,086 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,086 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,086 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,087 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,087 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,087 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,088 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,088 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,088 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,090 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,091 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,091 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,091 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,092 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,092 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,092 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,092 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,143 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,143 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,143 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,144 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,144 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,144 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,147 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,148 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,148 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,148 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,148 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,149 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,149 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,149 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,150 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,150 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,150 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,151 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,151 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,151 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,151 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,152 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,152 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,152 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,153 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,153 WARN L278 uchiComplementFKVNwa]: big8 [2020-07-29 01:30:23,360 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2020-07-29 01:30:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:23,360 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2020-07-29 01:30:23,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:23,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:23,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:23,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:30:23,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:30:23,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:23,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:23,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1787 states and 2714 transitions. [2020-07-29 01:30:23,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-07-29 01:30:23,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:23,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:23,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 96 states and 129 transitions. cyclomatic complexity: 42 [2020-07-29 01:30:23,373 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:23,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:30:23,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:30:23,374 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:23,374 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 [2020-07-29 01:30:23,374 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:23,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:23,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:23,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:23,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:23,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:23,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:23,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:23,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:23,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:23,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 1787 letters. Loop has 1787 letters. [2020-07-29 01:30:23,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1787 letters. Loop has 1787 letters. [2020-07-29 01:30:23,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 1787 letters. Loop has 1787 letters. [2020-07-29 01:30:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 96 letters. Loop has 96 letters. [2020-07-29 01:30:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:30:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:30:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:30:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:23,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 8 letters. Loop has 14 letters. [2020-07-29 01:30:23,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:23,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:23,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:23,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:24,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:24,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:24,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 6 letters. Loop has 14 letters. [2020-07-29 01:30:24,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:24,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:24,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:24,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:24,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:24,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:24,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 129 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 22 letters. [2020-07-29 01:30:24,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 22 letters. [2020-07-29 01:30:24,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 Stem has 8 letters. Loop has 22 letters. [2020-07-29 01:30:24,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,518 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2020-07-29 01:30:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:30:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-29 01:30:24,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:30:24,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2020-07-29 01:30:24,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2020-07-29 01:30:24,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:24,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. cyclomatic complexity: 950 [2020-07-29 01:30:24,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-07-29 01:30:24,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2020-07-29 01:30:24,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:30:24,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:30:24,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2020-07-29 01:30:24,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:24,713 INFO L688 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2020-07-29 01:30:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2020-07-29 01:30:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2020-07-29 01:30:24,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:24,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 471 states and 636 transitions. Second operand 260 states. [2020-07-29 01:30:24,725 INFO L74 IsIncluded]: Start isIncluded. First operand 471 states and 636 transitions. Second operand 260 states. [2020-07-29 01:30:24,725 INFO L87 Difference]: Start difference. First operand 471 states and 636 transitions. Second operand 260 states. [2020-07-29 01:30:24,726 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:24,744 INFO L93 Difference]: Finished difference Result 556 states and 757 transitions. [2020-07-29 01:30:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 757 transitions. [2020-07-29 01:30:24,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:24,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:24,746 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 471 states and 636 transitions. [2020-07-29 01:30:24,746 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 471 states and 636 transitions. [2020-07-29 01:30:24,746 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:24,761 INFO L93 Difference]: Finished difference Result 425 states and 584 transitions. [2020-07-29 01:30:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 584 transitions. [2020-07-29 01:30:24,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:24,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:24,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:24,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-07-29 01:30:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2020-07-29 01:30:24,770 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2020-07-29 01:30:24,770 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2020-07-29 01:30:24,770 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 01:30:24,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2020-07-29 01:30:24,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-07-29 01:30:24,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:24,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:24,772 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-29 01:30:24,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2020-07-29 01:30:24,772 INFO L794 eck$LassoCheckResult]: Stem: 7244#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 7252#L12-2 assume !!(main_~c~0 > 0); 7290#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 7260#L12-2 assume !!(main_~c~0 > 0); 7257#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 7240#L12-2 [2020-07-29 01:30:24,772 INFO L796 eck$LassoCheckResult]: Loop: 7240#L12-2 assume !!(main_~c~0 > 0); 7241#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 7457#L12-2 assume !!(main_~c~0 > 0); 7409#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 7399#L12-2 assume !!(main_~c~0 > 0); 7395#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 7392#L12-2 assume !!(main_~c~0 > 0); 7389#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 7375#L12-2 assume !!(main_~c~0 > 0); 7374#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 7365#L12-2 assume !!(main_~c~0 > 0); 7346#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 7347#L12-2 assume !!(main_~c~0 > 0); 7262#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 7284#L12-2 assume !!(main_~c~0 > 0); 7263#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 7261#L12-2 assume !!(main_~c~0 > 0); 7259#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 7240#L12-2 [2020-07-29 01:30:24,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2020-07-29 01:30:24,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:24,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922417588] [2020-07-29 01:30:24,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:24,777 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:24,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:24,780 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:24,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2020-07-29 01:30:24,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:24,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249400106] [2020-07-29 01:30:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:24,789 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:24,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:24,798 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2020-07-29 01:30:24,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:24,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924828887] [2020-07-29 01:30:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:24,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:24,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:24,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:25,012 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-07-29 01:30:25,059 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:25,059 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:25,059 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:25,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:25,060 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:25,060 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:25,060 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:25,060 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:25,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2020-07-29 01:30:25,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:25,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:25,067 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:30:25,074 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:30:25,077 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:30:25,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:25,190 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:25,190 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:25,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:25,194 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:25,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:25,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:25,251 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:25,252 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:25,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:25,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:25,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:25,253 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:25,253 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:25,253 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:25,253 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:25,253 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2020-07-29 01:30:25,253 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:25,253 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:25,260 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:30:25,268 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:30:25,273 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:30:25,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:30:25,396 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:25,396 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:25,399 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:30:25,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:25,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:25,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:25,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:25,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:25,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:25,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:25,404 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:25,407 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:25,407 INFO L444 ModelExtractionUtils]: 0 out of 3 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:25,409 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:25,409 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:25,409 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:25,409 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-07-29 01:30:25,432 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:25,435 INFO L393 LassoCheck]: Loop: "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" "assume !!(main_~c~0 > 0);" "assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1;" "assume !!(main_~c~0 > 0);" "assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0;" [2020-07-29 01:30:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:25,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:25,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:25,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {8542#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {8542#unseeded} is VALID [2020-07-29 01:30:25,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {8542#unseeded} assume !!(main_~c~0 > 0); {8542#unseeded} is VALID [2020-07-29 01:30:25,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {8542#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8542#unseeded} is VALID [2020-07-29 01:30:25,474 INFO L280 TraceCheckUtils]: 3: Hoare triple {8542#unseeded} assume !!(main_~c~0 > 0); {8542#unseeded} is VALID [2020-07-29 01:30:25,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {8542#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8542#unseeded} is VALID [2020-07-29 01:30:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:25,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:30:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:25,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:25,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume !!(main_~c~0 > 0); {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-29 01:30:25,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8575#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} is VALID [2020-07-29 01:30:25,859 INFO L280 TraceCheckUtils]: 2: Hoare triple {8575#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} assume !!(main_~c~0 > 0); {8575#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} is VALID [2020-07-29 01:30:25,860 INFO L280 TraceCheckUtils]: 3: Hoare triple {8575#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8582#(<= (+ ULTIMATE.start_main_~c~0 2) oldRank0)} is VALID [2020-07-29 01:30:25,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {8582#(<= (+ ULTIMATE.start_main_~c~0 2) oldRank0)} assume !!(main_~c~0 > 0); {8586#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (< 0 ULTIMATE.start_main_~c~0))} is VALID [2020-07-29 01:30:25,861 INFO L280 TraceCheckUtils]: 5: Hoare triple {8586#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (< 0 ULTIMATE.start_main_~c~0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:25,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:25,863 INFO L280 TraceCheckUtils]: 7: Hoare triple {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:25,863 INFO L280 TraceCheckUtils]: 8: Hoare triple {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:25,864 INFO L280 TraceCheckUtils]: 9: Hoare triple {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:25,864 INFO L280 TraceCheckUtils]: 10: Hoare triple {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:25,865 INFO L280 TraceCheckUtils]: 11: Hoare triple {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:25,866 INFO L280 TraceCheckUtils]: 12: Hoare triple {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:25,866 INFO L280 TraceCheckUtils]: 13: Hoare triple {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:25,867 INFO L280 TraceCheckUtils]: 14: Hoare triple {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:25,868 INFO L280 TraceCheckUtils]: 15: Hoare triple {8590#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:25,869 INFO L280 TraceCheckUtils]: 16: Hoare triple {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:25,869 INFO L280 TraceCheckUtils]: 17: Hoare triple {8597#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8555#(or (and (> oldRank0 ULTIMATE.start_main_~c~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-29 01:30:25,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:30:25,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:25,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,894 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-07-29 01:30:25,895 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2020-07-29 01:30:25,919 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2020-07-29 01:30:25,920 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:30:25,920 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:25,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. cyclomatic complexity: 137 [2020-07-29 01:30:25,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:25,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:25,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:25,921 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:25,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:25,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 420 transitions. [2020-07-29 01:30:25,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-07-29 01:30:25,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:25,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:25,924 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 260 states and 376 transitions. cyclomatic complexity: 137 [2020-07-29 01:30:25,925 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:25,925 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:30:25,925 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:25,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:25,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:25,926 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:25,926 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 276 states and 420 transitions. cyclomatic complexity: 165 [2020-07-29 01:30:25,926 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:25,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 276 letters. Loop has 276 letters. [2020-07-29 01:30:25,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 276 letters. Loop has 276 letters. [2020-07-29 01:30:25,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 276 letters. Loop has 276 letters. [2020-07-29 01:30:25,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:25,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:25,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:25,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:25,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:25,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:25,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:25,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:25,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:25,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:25,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:25,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:25,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:25,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:25,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:25,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:25,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:25,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:25,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,962 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:30:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-07-29 01:30:25,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:25,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:25,963 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:25,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:25,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:25,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {8542#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {8542#unseeded} is VALID [2020-07-29 01:30:25,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {8542#unseeded} assume !!(main_~c~0 > 0); {8542#unseeded} is VALID [2020-07-29 01:30:25,988 INFO L280 TraceCheckUtils]: 2: Hoare triple {8542#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8542#unseeded} is VALID [2020-07-29 01:30:25,989 INFO L280 TraceCheckUtils]: 3: Hoare triple {8542#unseeded} assume !!(main_~c~0 > 0); {8542#unseeded} is VALID [2020-07-29 01:30:25,989 INFO L280 TraceCheckUtils]: 4: Hoare triple {8542#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8542#unseeded} is VALID [2020-07-29 01:30:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:25,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:30:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:26,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:26,290 INFO L280 TraceCheckUtils]: 0: Hoare triple {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume !!(main_~c~0 > 0); {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-29 01:30:26,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8930#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} is VALID [2020-07-29 01:30:26,291 INFO L280 TraceCheckUtils]: 2: Hoare triple {8930#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} assume !!(main_~c~0 > 0); {8930#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} is VALID [2020-07-29 01:30:26,292 INFO L280 TraceCheckUtils]: 3: Hoare triple {8930#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8937#(<= (+ ULTIMATE.start_main_~c~0 2) oldRank0)} is VALID [2020-07-29 01:30:26,293 INFO L280 TraceCheckUtils]: 4: Hoare triple {8937#(<= (+ ULTIMATE.start_main_~c~0 2) oldRank0)} assume !!(main_~c~0 > 0); {8941#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (< 0 ULTIMATE.start_main_~c~0))} is VALID [2020-07-29 01:30:26,294 INFO L280 TraceCheckUtils]: 5: Hoare triple {8941#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (< 0 ULTIMATE.start_main_~c~0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,295 INFO L280 TraceCheckUtils]: 6: Hoare triple {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,295 INFO L280 TraceCheckUtils]: 7: Hoare triple {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,296 INFO L280 TraceCheckUtils]: 8: Hoare triple {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,297 INFO L280 TraceCheckUtils]: 9: Hoare triple {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,297 INFO L280 TraceCheckUtils]: 10: Hoare triple {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,298 INFO L280 TraceCheckUtils]: 11: Hoare triple {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,298 INFO L280 TraceCheckUtils]: 12: Hoare triple {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,299 INFO L280 TraceCheckUtils]: 13: Hoare triple {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,300 INFO L280 TraceCheckUtils]: 14: Hoare triple {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,300 INFO L280 TraceCheckUtils]: 15: Hoare triple {8945#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,301 INFO L280 TraceCheckUtils]: 16: Hoare triple {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,302 INFO L280 TraceCheckUtils]: 17: Hoare triple {8952#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8555#(or (and (> oldRank0 ULTIMATE.start_main_~c~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-29 01:30:26,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:30:26,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:26,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,318 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2020-07-29 01:30:26,318 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2020-07-29 01:30:26,341 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2020-07-29 01:30:26,342 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:30:26,342 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:26,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. cyclomatic complexity: 137 [2020-07-29 01:30:26,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:26,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:26,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:26,343 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:26,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:26,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 420 transitions. [2020-07-29 01:30:26,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-07-29 01:30:26,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:26,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:26,346 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 260 states and 376 transitions. cyclomatic complexity: 137 [2020-07-29 01:30:26,346 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:26,346 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:30:26,346 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:26,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:26,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:26,347 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:26,347 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 276 states and 420 transitions. cyclomatic complexity: 165 [2020-07-29 01:30:26,348 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:26,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 276 letters. Loop has 276 letters. [2020-07-29 01:30:26,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 276 letters. Loop has 276 letters. [2020-07-29 01:30:26,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 276 letters. Loop has 276 letters. [2020-07-29 01:30:26,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:26,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:26,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:26,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:26,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:26,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:26,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:26,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:26,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:26,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:26,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:26,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:26,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 276 states and 420 transitions. cyclomatic complexity: 165 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,384 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:30:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-07-29 01:30:26,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,385 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:26,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:26,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:26,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {8542#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {8542#unseeded} is VALID [2020-07-29 01:30:26,412 INFO L280 TraceCheckUtils]: 1: Hoare triple {8542#unseeded} assume !!(main_~c~0 > 0); {8542#unseeded} is VALID [2020-07-29 01:30:26,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {8542#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8542#unseeded} is VALID [2020-07-29 01:30:26,413 INFO L280 TraceCheckUtils]: 3: Hoare triple {8542#unseeded} assume !!(main_~c~0 > 0); {8542#unseeded} is VALID [2020-07-29 01:30:26,413 INFO L280 TraceCheckUtils]: 4: Hoare triple {8542#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8542#unseeded} is VALID [2020-07-29 01:30:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:26,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:30:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:26,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:26,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume !!(main_~c~0 > 0); {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-29 01:30:26,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9285#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} is VALID [2020-07-29 01:30:26,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {9285#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} assume !!(main_~c~0 > 0); {9285#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} is VALID [2020-07-29 01:30:26,710 INFO L280 TraceCheckUtils]: 3: Hoare triple {9285#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9292#(<= (+ ULTIMATE.start_main_~c~0 2) oldRank0)} is VALID [2020-07-29 01:30:26,710 INFO L280 TraceCheckUtils]: 4: Hoare triple {9292#(<= (+ ULTIMATE.start_main_~c~0 2) oldRank0)} assume !!(main_~c~0 > 0); {9296#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (< 0 ULTIMATE.start_main_~c~0))} is VALID [2020-07-29 01:30:26,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {9296#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (< 0 ULTIMATE.start_main_~c~0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,716 INFO L280 TraceCheckUtils]: 12: Hoare triple {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,717 INFO L280 TraceCheckUtils]: 13: Hoare triple {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,717 INFO L280 TraceCheckUtils]: 14: Hoare triple {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:26,718 INFO L280 TraceCheckUtils]: 15: Hoare triple {9300#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,718 INFO L280 TraceCheckUtils]: 16: Hoare triple {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:26,719 INFO L280 TraceCheckUtils]: 17: Hoare triple {9307#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8555#(or (and (> oldRank0 ULTIMATE.start_main_~c~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-29 01:30:26,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:30:26,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:26,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,743 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 6 loop predicates [2020-07-29 01:30:26,743 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2020-07-29 01:30:26,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 392 states and 547 transitions. Complement of second has 7 states. [2020-07-29 01:30:26,789 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:30:26,789 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:26,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. cyclomatic complexity: 137 [2020-07-29 01:30:26,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:26,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:26,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:26,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:26,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:26,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:26,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 392 states and 547 transitions. [2020-07-29 01:30:26,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-07-29 01:30:26,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:26,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:26,794 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 260 states and 376 transitions. cyclomatic complexity: 137 [2020-07-29 01:30:26,794 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:26,794 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:30:26,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:26,795 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:26,795 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 392 states and 547 transitions. cyclomatic complexity: 176 [2020-07-29 01:30:26,795 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:26,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:26,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:26,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:26,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 392 letters. Loop has 392 letters. [2020-07-29 01:30:26,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 392 letters. Loop has 392 letters. [2020-07-29 01:30:26,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 392 letters. Loop has 392 letters. [2020-07-29 01:30:26,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:26,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:26,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:26,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:26,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:26,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:26,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:26,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:26,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:26,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:26,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:26,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:26,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 10 letters. Loop has 18 letters. [2020-07-29 01:30:26,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 10 letters. Loop has 18 letters. [2020-07-29 01:30:26,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 10 letters. Loop has 18 letters. [2020-07-29 01:30:26,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 392 states and 547 transitions. cyclomatic complexity: 176 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:26,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,840 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:30:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-29 01:30:26,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:26,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:26,841 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:26,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:26,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:26,867 INFO L280 TraceCheckUtils]: 0: Hoare triple {8542#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; {8542#unseeded} is VALID [2020-07-29 01:30:26,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {8542#unseeded} assume !!(main_~c~0 > 0); {8542#unseeded} is VALID [2020-07-29 01:30:26,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {8542#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8542#unseeded} is VALID [2020-07-29 01:30:26,869 INFO L280 TraceCheckUtils]: 3: Hoare triple {8542#unseeded} assume !!(main_~c~0 > 0); {8542#unseeded} is VALID [2020-07-29 01:30:26,869 INFO L280 TraceCheckUtils]: 4: Hoare triple {8542#unseeded} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8542#unseeded} is VALID [2020-07-29 01:30:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:26,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:30:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:26,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:27,222 INFO L280 TraceCheckUtils]: 0: Hoare triple {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume !!(main_~c~0 > 0); {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-29 01:30:27,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {8545#(>= oldRank0 ULTIMATE.start_main_~c~0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9759#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} is VALID [2020-07-29 01:30:27,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {9759#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} assume !!(main_~c~0 > 0); {9759#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} is VALID [2020-07-29 01:30:27,227 INFO L280 TraceCheckUtils]: 3: Hoare triple {9759#(<= (+ ULTIMATE.start_main_~c~0 1) oldRank0)} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9766#(<= (+ ULTIMATE.start_main_~c~0 2) oldRank0)} is VALID [2020-07-29 01:30:27,228 INFO L280 TraceCheckUtils]: 4: Hoare triple {9766#(<= (+ ULTIMATE.start_main_~c~0 2) oldRank0)} assume !!(main_~c~0 > 0); {9770#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (< 0 ULTIMATE.start_main_~c~0))} is VALID [2020-07-29 01:30:27,229 INFO L280 TraceCheckUtils]: 5: Hoare triple {9770#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (< 0 ULTIMATE.start_main_~c~0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:27,231 INFO L280 TraceCheckUtils]: 6: Hoare triple {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:27,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:27,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:27,236 INFO L280 TraceCheckUtils]: 9: Hoare triple {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:27,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:27,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:27,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:27,243 INFO L280 TraceCheckUtils]: 13: Hoare triple {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:27,246 INFO L280 TraceCheckUtils]: 14: Hoare triple {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume !!(main_~c~0 > 0); {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} is VALID [2020-07-29 01:30:27,248 INFO L280 TraceCheckUtils]: 15: Hoare triple {9774#(and (<= 3 oldRank0) (<= (+ ULTIMATE.start_main_~c~0 1) oldRank0))} assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:27,249 INFO L280 TraceCheckUtils]: 16: Hoare triple {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !!(main_~c~0 > 0); {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} is VALID [2020-07-29 01:30:27,250 INFO L280 TraceCheckUtils]: 17: Hoare triple {9781#(and (<= (+ ULTIMATE.start_main_~c~0 2) oldRank0) (<= 3 oldRank0))} assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; {8555#(or (and (> oldRank0 ULTIMATE.start_main_~c~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-29 01:30:27,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:30:27,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:27,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:27,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,276 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2020-07-29 01:30:27,276 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2020-07-29 01:30:27,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 511 states and 724 transitions. Complement of second has 12 states. [2020-07-29 01:30:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:27,393 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:27,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. cyclomatic complexity: 137 [2020-07-29 01:30:27,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:27,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:27,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:27,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:30:27,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:27,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:27,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 511 states and 724 transitions. [2020-07-29 01:30:27,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:27,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:27,398 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 260 states and 376 transitions. cyclomatic complexity: 137 [2020-07-29 01:30:27,398 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:27,398 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:30:27,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:30:27,399 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:27,399 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 511 states and 724 transitions. cyclomatic complexity: 244 [2020-07-29 01:30:27,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 511 states and 724 transitions. cyclomatic complexity: 244 [2020-07-29 01:30:27,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:27,400 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:27,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 511 states and 724 transitions. cyclomatic complexity: 244 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:27,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:30:27,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:30:27,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 511 states and 724 transitions. cyclomatic complexity: 244 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:30:27,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 511 letters. Loop has 511 letters. [2020-07-29 01:30:27,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 511 letters. Loop has 511 letters. [2020-07-29 01:30:27,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 511 states and 724 transitions. cyclomatic complexity: 244 Stem has 511 letters. Loop has 511 letters. [2020-07-29 01:30:27,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:27,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:27,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 511 states and 724 transitions. cyclomatic complexity: 244 Stem has 260 letters. Loop has 260 letters. [2020-07-29 01:30:27,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:30:27,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:30:27,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 511 states and 724 transitions. cyclomatic complexity: 244 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:30:27,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:27,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:27,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 511 states and 724 transitions. cyclomatic complexity: 244 Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:27,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:27,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:27,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 511 states and 724 transitions. cyclomatic complexity: 244 Stem has 6 letters. Loop has 18 letters. [2020-07-29 01:30:27,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:27,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:27,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 511 states and 724 transitions. cyclomatic complexity: 244 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:30:27,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 376 transitions. cyclomatic complexity: 137 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:30:27,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:30:27,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 511 states and 724 transitions. cyclomatic complexity: 244 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:30:27,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,441 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:30:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-07-29 01:30:27,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2020-07-29 01:30:27,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2020-07-29 01:30:27,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2020-07-29 01:30:27,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. cyclomatic complexity: 244 [2020-07-29 01:30:27,458 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:27,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2020-07-29 01:30:27,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:30:27,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:30:27,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:30:27,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:30:27,459 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:27,459 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:27,460 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:27,460 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 01:30:27,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:30:27,460 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:27,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:27,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:30:27 BoogieIcfgContainer [2020-07-29 01:30:27,470 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:30:27,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:30:27,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:30:27,471 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:30:27,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:30:07" (3/4) ... [2020-07-29 01:30:27,474 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:30:27,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:30:27,477 INFO L168 Benchmark]: Toolchain (without parser) took 20539.58 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 454.6 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -133.9 MB). Peak memory consumption was 320.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:27,477 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:27,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.82 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:27,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.89 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:27,478 INFO L168 Benchmark]: Boogie Preprocessor took 74.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:27,479 INFO L168 Benchmark]: RCFGBuilder took 258.31 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:27,479 INFO L168 Benchmark]: BuchiAutomizer took 19921.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 310.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 343.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:27,480 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:27,482 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.82 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.89 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 258.31 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19921.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 310.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 343.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 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 15 terminating modules (4 trivial, 4 deterministic, 7 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 201 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.8s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 8.0s. Construction of modules took 0.6s. Büchi inclusion checks took 10.4s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 335 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 260 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 3, 1, 3]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 105/148 HoareTripleCheckerStatistics: 159 SDtfs, 258 SDslu, 75 SDs, 0 SdLazy, 285 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax158 hnf95 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp98 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...