./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.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 687269bb6882b72a3d48999f1e5c55a1d5283a94 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:02,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:02,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:02,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:02,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:02,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:02,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:02,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:02,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:02,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:02,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:02,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:02,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:02,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:02,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:02,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:02,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:02,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:02,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:02,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:02,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:02,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:02,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:02,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:02,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:02,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:02,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:02,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:02,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:02,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:02,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:02,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:02,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:02,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:02,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:02,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:02,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:02,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:02,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:02,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:02,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:02,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:02,960 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:02,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:02,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:02,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:02,964 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:02,964 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:02,965 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:02,965 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:02,965 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:02,966 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:02,967 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:02,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:02,968 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:02,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:02,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:02,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:02,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:02,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:02,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:02,971 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:02,972 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:02,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:02,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:02,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:02,976 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:02,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:02,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:02,977 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:02,978 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:02,980 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:02,980 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 -> 687269bb6882b72a3d48999f1e5c55a1d5283a94 [2020-07-29 01:28:03,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:03,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:03,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:03,302 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:03,303 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:03,304 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.c [2020-07-29 01:28:03,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8728be2a3/ec56b578a3f048fa8ed1b860f249bb33/FLAGa2e94f471 [2020-07-29 01:28:03,881 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:03,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.c [2020-07-29 01:28:03,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8728be2a3/ec56b578a3f048fa8ed1b860f249bb33/FLAGa2e94f471 [2020-07-29 01:28:04,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8728be2a3/ec56b578a3f048fa8ed1b860f249bb33 [2020-07-29 01:28:04,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:04,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:04,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:04,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:04,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:04,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358459c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04, skipping insertion in model container [2020-07-29 01:28:04,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:04,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:04,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:04,585 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:04,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:04,624 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:04,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04 WrapperNode [2020-07-29 01:28:04,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:04,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:04,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:04,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:04,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:04,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:04,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:04,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:04,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... [2020-07-29 01:28:04,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:04,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:04,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:04,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:04,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:04,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:04,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:05,053 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:05,054 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:28:05,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:05 BoogieIcfgContainer [2020-07-29 01:28:05,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:05,059 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:05,059 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:05,063 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:05,064 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:05,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:04" (1/3) ... [2020-07-29 01:28:05,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a230fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:05, skipping insertion in model container [2020-07-29 01:28:05,067 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:05,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:04" (2/3) ... [2020-07-29 01:28:05,068 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a230fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:05, skipping insertion in model container [2020-07-29 01:28:05,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:05,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:05" (3/3) ... [2020-07-29 01:28:05,071 INFO L371 chiAutomizerObserver]: Analyzing ICFG TelAviv-Amir-Minimum.c [2020-07-29 01:28:05,129 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:05,129 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:05,130 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:05,130 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:05,130 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:05,130 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:05,131 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:05,131 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:05,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:28:05,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:05,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:05,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:05,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:05,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:05,178 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:05,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:28:05,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:05,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:05,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:05,182 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:05,182 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:05,189 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 8#L25-2true [2020-07-29 01:28:05,189 INFO L796 eck$LassoCheckResult]: Loop: 8#L25-2true assume !!(main_~x~0 > 0 && main_~y~0 > 0); 12#L25true assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4#L26true assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 10#L26-2true main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8#L25-2true [2020-07-29 01:28:05,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:28:05,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:05,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815165898] [2020-07-29 01:28:05,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:05,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:05,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:05,298 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1234440, now seen corresponding path program 1 times [2020-07-29 01:28:05,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:05,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843398733] [2020-07-29 01:28:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:05,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:05,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:05,324 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash 29863591, now seen corresponding path program 1 times [2020-07-29 01:28:05,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:05,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873640546] [2020-07-29 01:28:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:05,336 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:05,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:05,346 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:05,468 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:05,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:05,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:05,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:05,470 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:05,470 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:05,470 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:05,470 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:05,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration1_Loop [2020-07-29 01:28:05,470 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:05,471 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:05,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:05,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:05,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:05,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:05,802 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-07-29 01:28:05,925 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:05,926 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:05,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:05,936 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:05,948 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:05,949 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:05,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:05,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:05,985 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:05,986 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:28:06,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:06,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:06,022 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:06,023 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=-5} Honda state: {ULTIMATE.start_main_#t~nondet2=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:06,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:06,063 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:06,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:06,099 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:06,191 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:06,193 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:06,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:06,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:06,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:06,193 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:06,194 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:06,194 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:06,194 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:06,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration1_Loop [2020-07-29 01:28:06,195 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:06,195 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:06,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:06,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:06,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:06,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:06,412 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:06,416 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:06,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:06,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:06,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:06,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:06,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:06,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:06,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:06,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:06,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:06,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:06,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:06,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:06,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:06,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:06,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:06,512 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:06,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:06,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:06,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:06,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:06,565 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:06,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:06,567 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:06,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:06,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:06,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:06,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:06,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:06,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:06,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:06,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:06,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:06,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:06,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:06,638 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:06,638 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:06,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:06,653 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:06,653 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:06,654 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:06,698 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:06,703 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;" "assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1;" "main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;" [2020-07-29 01:28:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:06,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:06,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:06,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:06,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {21#unseeded} is VALID [2020-07-29 01:28:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:06,784 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:06,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:06,935 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {39#(and (<= ULTIMATE.start_main_~y~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:06,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#(and (<= ULTIMATE.start_main_~y~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {39#(and (<= ULTIMATE.start_main_~y~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:06,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(and (<= ULTIMATE.start_main_~y~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {46#(and (<= (+ ULTIMATE.start_main_~y~0 2) oldRank0) (<= 2 oldRank0))} is VALID [2020-07-29 01:28:06,939 INFO L280 TraceCheckUtils]: 3: Hoare triple {46#(and (<= (+ ULTIMATE.start_main_~y~0 2) oldRank0) (<= 2 oldRank0))} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {34#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:06,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:06,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:06,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:06,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:06,975 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:28:06,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2020-07-29 01:28:07,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 40 states and 55 transitions. Complement of second has 8 states. [2020-07-29 01:28:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:07,103 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:07,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:28:07,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:07,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:07,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:07,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:07,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:28:07,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:07,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:07,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 55 transitions. [2020-07-29 01:28:07,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 01:28:07,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:07,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:07,117 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:28:07,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:07,120 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:07,120 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:07,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:28:07,124 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:07,124 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 55 transitions. cyclomatic complexity: 18 [2020-07-29 01:28:07,127 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:28:07,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:07,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:07,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:07,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:07,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:07,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:07,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:28:07,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:28:07,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:28:07,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:07,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:07,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:07,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:07,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:07,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:07,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:07,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:07,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:07,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:07,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:07,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:07,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:07,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:07,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:07,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:07,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:07,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:07,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:07,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:07,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:07,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:07,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:07,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:07,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:07,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:07,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:07,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:07,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:07,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:07,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:07,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:07,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:07,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:07,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:07,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:07,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:07,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:07,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:07,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:07,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:07,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:07,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:07,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:07,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:07,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:07,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:07,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:07,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:07,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:07,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:07,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 55 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:07,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,178 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 01:28:07,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:07,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:07,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 8 letters. [2020-07-29 01:28:07,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:07,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 55 transitions. cyclomatic complexity: 18 [2020-07-29 01:28:07,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 01:28:07,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 21 states and 30 transitions. [2020-07-29 01:28:07,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:28:07,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:28:07,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-07-29 01:28:07,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:07,201 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 01:28:07,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-07-29 01:28:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2020-07-29 01:28:07,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:07,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 30 transitions. Second operand 17 states. [2020-07-29 01:28:07,225 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 30 transitions. Second operand 17 states. [2020-07-29 01:28:07,227 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 17 states. [2020-07-29 01:28:07,230 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:07,233 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-07-29 01:28:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2020-07-29 01:28:07,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:07,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:07,235 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 21 states and 30 transitions. [2020-07-29 01:28:07,235 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 21 states and 30 transitions. [2020-07-29 01:28:07,236 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:07,240 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2020-07-29 01:28:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:28:07,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:07,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:07,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:07,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:28:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-07-29 01:28:07,245 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 01:28:07,245 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 01:28:07,245 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:07,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-07-29 01:28:07,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 01:28:07,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:07,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:07,247 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:07,247 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:07,248 INFO L794 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 109#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 112#L25 [2020-07-29 01:28:07,248 INFO L796 eck$LassoCheckResult]: Loop: 112#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 103#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 104#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 111#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 112#L25 [2020-07-29 01:28:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:28:07,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:07,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527634862] [2020-07-29 01:28:07,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:07,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:07,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:07,261 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:07,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1328732, now seen corresponding path program 1 times [2020-07-29 01:28:07,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:07,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527271739] [2020-07-29 01:28:07,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:07,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:07,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:07,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash 925773253, now seen corresponding path program 1 times [2020-07-29 01:28:07,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:07,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221016470] [2020-07-29 01:28:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:07,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:07,291 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:07,293 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:07,332 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:07,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:07,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:07,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:07,333 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:07,333 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:07,333 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:07,333 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:07,333 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration2_Loop [2020-07-29 01:28:07,333 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:07,333 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:07,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:07,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:07,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:07,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:07,509 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:07,509 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:07,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:07,513 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:28:07,521 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:07,521 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:07,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:07,569 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:07,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:07,630 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:07,790 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:07,792 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:07,793 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:07,793 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:07,793 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:07,793 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:07,793 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:07,793 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:07,793 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:07,794 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration2_Loop [2020-07-29 01:28:07,794 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:07,794 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:07,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:07,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:07,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:07,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:07,992 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:07,992 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:07,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:08,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:08,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:08,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:08,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:08,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:08,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:08,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:08,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:08,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:08,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:08,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:08,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:08,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:08,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:08,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:08,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:08,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:08,056 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:08,062 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:08,062 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:08,062 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:08,062 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-07-29 01:28:08,088 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:08,107 INFO L393 LassoCheck]: Loop: "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;" "assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1;" "main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" [2020-07-29 01:28:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:08,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:08,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:08,145 INFO L280 TraceCheckUtils]: 0: Hoare triple {209#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {209#unseeded} is VALID [2020-07-29 01:28:08,146 INFO L280 TraceCheckUtils]: 1: Hoare triple {209#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {209#unseeded} is VALID [2020-07-29 01:28:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:08,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:08,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:08,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {212#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {212#(>= oldRank0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:28:08,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {212#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {233#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:08,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {233#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:08,268 INFO L280 TraceCheckUtils]: 3: Hoare triple {233#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {222#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:08,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:08,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:08,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:08,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,282 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:08,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-07-29 01:28:08,365 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2020-07-29 01:28:08,365 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:28:08,366 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:08,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:08,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:08,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:08,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:08,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:08,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:08,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:08,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 44 transitions. [2020-07-29 01:28:08,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:08,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:08,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:08,372 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:08,375 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:28:08,376 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:08,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:08,378 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:08,378 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:28:08,380 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:08,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:08,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:08,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:08,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:08,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:08,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:08,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:08,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:08,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:08,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:08,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:08,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:08,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:08,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:08,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:08,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:08,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:08,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:08,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:08,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:08,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:08,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:08,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:08,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:08,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:08,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:08,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:08,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:08,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:08,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:08,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:08,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:08,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:08,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:08,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:08,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:08,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:08,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:08,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:08,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:08,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:08,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:08,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:08,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:08,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:08,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:08,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:08,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:08,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:08,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:08,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:08,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:08,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:08,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:08,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:08,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:08,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:08,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 44 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:08,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,420 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 01:28:08,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:08,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:08,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:28:08,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:08,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:28:08,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:08,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 21 states and 30 transitions. [2020-07-29 01:28:08,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:28:08,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:28:08,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-07-29 01:28:08,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:08,430 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 01:28:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-07-29 01:28:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-29 01:28:08,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:08,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 30 transitions. Second operand 19 states. [2020-07-29 01:28:08,434 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 30 transitions. Second operand 19 states. [2020-07-29 01:28:08,434 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 19 states. [2020-07-29 01:28:08,435 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:08,438 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2020-07-29 01:28:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:28:08,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:08,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:08,439 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states and 30 transitions. [2020-07-29 01:28:08,439 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states and 30 transitions. [2020-07-29 01:28:08,440 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:08,442 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2020-07-29 01:28:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:28:08,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:08,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:08,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:08,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:28:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2020-07-29 01:28:08,455 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2020-07-29 01:28:08,455 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2020-07-29 01:28:08,456 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:08,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2020-07-29 01:28:08,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:08,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:08,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:08,458 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:08,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:08,458 INFO L794 eck$LassoCheckResult]: Stem: 286#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 287#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 294#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 288#L33 [2020-07-29 01:28:08,459 INFO L796 eck$LassoCheckResult]: Loop: 288#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 280#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 281#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 295#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 288#L33 [2020-07-29 01:28:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash 31084, now seen corresponding path program 1 times [2020-07-29 01:28:08,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:08,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204701596] [2020-07-29 01:28:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:08,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:08,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:08,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1696497, now seen corresponding path program 1 times [2020-07-29 01:28:08,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:08,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289181718] [2020-07-29 01:28:08,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:08,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:08,501 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:08,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:08,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1357271332, now seen corresponding path program 1 times [2020-07-29 01:28:08,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:08,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646067925] [2020-07-29 01:28:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:08,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:08,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:08,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:08,573 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:08,573 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:08,573 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:08,573 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:08,574 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:08,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:08,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:08,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:08,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration3_Loop [2020-07-29 01:28:08,574 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:08,575 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:08,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:08,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:08,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:08,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:08,767 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:08,768 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:08,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:08,783 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:08,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:08,791 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:08,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:08,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:08,845 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:08,845 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:08,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:08,892 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:08,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:08,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:09,064 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:09,067 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:09,067 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:09,067 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:09,067 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:09,067 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:09,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:09,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:09,067 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:09,067 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration3_Loop [2020-07-29 01:28:09,068 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:09,068 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:09,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:09,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:09,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:09,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:09,235 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:09,235 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:09,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:09,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:09,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:09,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:09,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:09,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:09,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:09,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:09,251 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:09,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:09,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:09,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:09,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:09,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:09,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:09,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:09,290 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:09,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:09,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:09,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:09,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:09,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:09,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:09,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:09,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:09,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:09,332 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:09,333 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:09,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:09,335 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:09,335 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:09,335 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:28:09,357 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:09,361 INFO L393 LassoCheck]: Loop: "assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1;" "main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;" [2020-07-29 01:28:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:09,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:09,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:09,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:09,394 INFO L280 TraceCheckUtils]: 0: Hoare triple {394#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {394#unseeded} is VALID [2020-07-29 01:28:09,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {394#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {394#unseeded} is VALID [2020-07-29 01:28:09,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {394#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {394#unseeded} is VALID [2020-07-29 01:28:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:09,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:09,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:09,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {397#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {418#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:09,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {418#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {418#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:09,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {418#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {425#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:09,476 INFO L280 TraceCheckUtils]: 3: Hoare triple {425#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {407#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:09,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:09,485 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:28:09,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:09,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,486 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:28:09,487 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:28:09,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 32 states and 48 transitions. Complement of second has 7 states. [2020-07-29 01:28:09,565 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:28:09,566 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:09,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. cyclomatic complexity: 11 [2020-07-29 01:28:09,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:09,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:09,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:09,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:09,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:09,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:09,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 48 transitions. [2020-07-29 01:28:09,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:09,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:09,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:09,571 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 27 transitions. cyclomatic complexity: 11 [2020-07-29 01:28:09,572 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:09,572 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:09,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:09,573 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:09,574 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 01:28:09,578 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:09,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:09,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:09,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:09,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:09,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:09,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:09,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:09,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:09,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:09,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:28:09,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:28:09,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:28:09,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:28:09,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:28:09,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:28:09,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:09,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:09,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:09,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:09,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:09,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:09,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:09,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:09,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:09,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:09,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:09,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:09,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:09,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:09,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:09,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:09,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:09,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:09,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:09,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:09,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:09,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:09,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:09,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:09,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:09,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:09,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:09,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:09,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:09,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:09,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:09,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:09,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:09,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:09,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:09,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:09,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:09,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:09,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:09,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:09,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:09,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:09,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,611 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-29 01:28:09,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:09,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:09,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:28:09,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:09,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 01:28:09,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:09,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 38 transitions. [2020-07-29 01:28:09,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:28:09,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:28:09,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 38 transitions. [2020-07-29 01:28:09,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:09,619 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 38 transitions. [2020-07-29 01:28:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 38 transitions. [2020-07-29 01:28:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-29 01:28:09,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:09,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 38 transitions. Second operand 24 states. [2020-07-29 01:28:09,623 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 38 transitions. Second operand 24 states. [2020-07-29 01:28:09,623 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 24 states. [2020-07-29 01:28:09,623 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:09,626 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2020-07-29 01:28:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-07-29 01:28:09,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:09,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:09,627 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states and 38 transitions. [2020-07-29 01:28:09,627 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states and 38 transitions. [2020-07-29 01:28:09,627 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:09,630 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2020-07-29 01:28:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-07-29 01:28:09,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:09,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:09,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:09,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:28:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2020-07-29 01:28:09,633 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-07-29 01:28:09,634 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-07-29 01:28:09,634 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:09,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2020-07-29 01:28:09,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:09,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:09,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:09,635 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-07-29 01:28:09,636 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:09,636 INFO L794 eck$LassoCheckResult]: Stem: 480#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 481#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 488#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 482#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 473#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 474#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 492#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 475#L26 [2020-07-29 01:28:09,636 INFO L796 eck$LassoCheckResult]: Loop: 475#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 476#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 472#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 491#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 475#L26 [2020-07-29 01:28:09,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:09,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1357211759, now seen corresponding path program 1 times [2020-07-29 01:28:09,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:09,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660481492] [2020-07-29 01:28:09,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:09,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:09,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:09,652 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:09,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1419720, now seen corresponding path program 2 times [2020-07-29 01:28:09,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:09,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138037536] [2020-07-29 01:28:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:09,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:09,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:09,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:09,665 INFO L82 PathProgramCache]: Analyzing trace with hash -369493672, now seen corresponding path program 1 times [2020-07-29 01:28:09,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:09,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128024852] [2020-07-29 01:28:09,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:09,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:09,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:09,683 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:09,714 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:09,714 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:09,715 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:09,715 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:09,715 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:09,715 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:09,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:09,715 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:09,716 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration4_Loop [2020-07-29 01:28:09,716 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:09,716 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:09,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:09,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:09,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:09,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:09,895 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:09,895 INFO L404 LassoAnalysis]: Checking for nontermination... 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:28:09,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:09,900 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:09,904 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:09,904 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=-5} Honda state: {ULTIMATE.start_main_#t~nondet2=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:09,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:09,930 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:09,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:09,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:10,072 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:10,074 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:10,074 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:10,074 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:10,074 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:10,074 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:10,074 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:10,074 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:10,074 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:10,075 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration4_Loop [2020-07-29 01:28:10,075 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:10,075 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:10,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:10,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:28:10,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:10,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:10,236 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:10,236 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:10,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:10,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:10,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:10,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:10,242 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:10,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:10,243 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:10,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:10,245 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:10,269 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:10,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:10,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:10,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:10,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:10,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:10,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:10,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:10,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:10,285 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:28:10,285 INFO L444 ModelExtractionUtils]: 3 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:10,288 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:10,288 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:10,289 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:10,289 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:10,325 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:10,328 INFO L393 LassoCheck]: Loop: "assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1;" "main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;" [2020-07-29 01:28:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:10,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:10,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:10,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:10,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {610#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {610#unseeded} is VALID [2020-07-29 01:28:10,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {610#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {610#unseeded} is VALID [2020-07-29 01:28:10,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {610#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {610#unseeded} is VALID [2020-07-29 01:28:10,363 INFO L280 TraceCheckUtils]: 3: Hoare triple {610#unseeded} assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; {610#unseeded} is VALID [2020-07-29 01:28:10,363 INFO L280 TraceCheckUtils]: 4: Hoare triple {610#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {610#unseeded} is VALID [2020-07-29 01:28:10,364 INFO L280 TraceCheckUtils]: 5: Hoare triple {610#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {610#unseeded} is VALID [2020-07-29 01:28:10,364 INFO L280 TraceCheckUtils]: 6: Hoare triple {610#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {610#unseeded} is VALID [2020-07-29 01:28:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:10,369 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:10,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:10,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {613#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {646#(<= (+ ULTIMATE.start_main_~y~0 2) oldRank0)} is VALID [2020-07-29 01:28:10,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {646#(<= (+ ULTIMATE.start_main_~y~0 2) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {646#(<= (+ ULTIMATE.start_main_~y~0 2) oldRank0)} is VALID [2020-07-29 01:28:10,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {646#(<= (+ ULTIMATE.start_main_~y~0 2) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {653#(and (<= (+ ULTIMATE.start_main_~y~0 2) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:28:10,455 INFO L280 TraceCheckUtils]: 3: Hoare triple {653#(and (<= (+ ULTIMATE.start_main_~y~0 2) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {623#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:10,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:10,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:10,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:10,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:28:10,464 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-07-29 01:28:10,544 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 78 states and 116 transitions. Complement of second has 7 states. [2020-07-29 01:28:10,545 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:28:10,545 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:10,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 01:28:10,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:10,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:10,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:10,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:10,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:10,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:10,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 116 transitions. [2020-07-29 01:28:10,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 01:28:10,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:10,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:10,556 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 01:28:10,559 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:10,559 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:10,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:10,561 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:10,561 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 78 states and 116 transitions. cyclomatic complexity: 48 [2020-07-29 01:28:10,563 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:28:10,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:10,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:10,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:10,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:10,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:10,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:10,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:10,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:10,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:10,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 78 letters. Loop has 78 letters. [2020-07-29 01:28:10,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 78 letters. Loop has 78 letters. [2020-07-29 01:28:10,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 78 letters. Loop has 78 letters. [2020-07-29 01:28:10,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:28:10,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:28:10,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:28:10,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:10,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:10,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:10,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:10,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:10,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:10,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:10,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:10,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:10,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:10,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:10,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:10,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:10,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:10,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:10,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:10,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:10,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:10,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:10,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:10,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:10,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:10,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:10,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:10,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:10,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:10,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:10,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:10,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:10,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:10,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:10,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:10,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:10,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:10,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:10,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:10,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:10,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:10,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:10,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:10,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:10,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:10,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:10,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:10,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:10,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 116 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,600 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-29 01:28:10,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:28:10,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:10,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:10,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:10,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 116 transitions. cyclomatic complexity: 48 [2020-07-29 01:28:10,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 01:28:10,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 55 states and 80 transitions. [2020-07-29 01:28:10,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 01:28:10,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-07-29 01:28:10,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 80 transitions. [2020-07-29 01:28:10,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:10,610 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 80 transitions. [2020-07-29 01:28:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 80 transitions. [2020-07-29 01:28:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2020-07-29 01:28:10,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:10,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states and 80 transitions. Second operand 42 states. [2020-07-29 01:28:10,614 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states and 80 transitions. Second operand 42 states. [2020-07-29 01:28:10,614 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 42 states. [2020-07-29 01:28:10,615 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:10,619 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2020-07-29 01:28:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2020-07-29 01:28:10,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:10,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:10,620 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 55 states and 80 transitions. [2020-07-29 01:28:10,621 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 55 states and 80 transitions. [2020-07-29 01:28:10,621 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:10,625 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2020-07-29 01:28:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2020-07-29 01:28:10,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:10,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:10,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:10,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 01:28:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2020-07-29 01:28:10,630 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2020-07-29 01:28:10,630 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2020-07-29 01:28:10,630 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:10,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 63 transitions. [2020-07-29 01:28:10,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 01:28:10,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:10,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:10,632 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:28:10,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:10,633 INFO L794 eck$LassoCheckResult]: Stem: 754#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 755#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 763#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 764#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 780#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 779#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 776#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 774#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 750#L26-2 [2020-07-29 01:28:10,633 INFO L796 eck$LassoCheckResult]: Loop: 750#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 786#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 769#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 749#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 750#L26-2 [2020-07-29 01:28:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash 876108449, now seen corresponding path program 1 times [2020-07-29 01:28:10,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:10,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995813664] [2020-07-29 01:28:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:10,642 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:10,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:10,649 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:10,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1529372, now seen corresponding path program 2 times [2020-07-29 01:28:10,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:10,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24762979] [2020-07-29 01:28:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:10,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:10,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:10,660 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:10,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:10,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1432445116, now seen corresponding path program 1 times [2020-07-29 01:28:10,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:10,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110744372] [2020-07-29 01:28:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:10,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:10,686 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:10,689 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:10,732 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:10,733 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:10,733 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:10,733 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:10,733 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:10,733 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:10,733 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:10,734 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:10,734 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration5_Loop [2020-07-29 01:28:10,734 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:10,734 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:10,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:10,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:10,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:10,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:10,911 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:10,911 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:10,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:10,917 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:10,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:10,960 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:10,989 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:10,990 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:10,990 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:10,990 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:10,991 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:10,991 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:10,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:10,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:10,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:10,991 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration5_Loop [2020-07-29 01:28:10,991 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:10,992 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:11,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:11,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:28:11,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:28:11,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:11,153 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:11,154 INFO L489 LassoAnalysis]: Using template 'affine'. 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:28:11,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:11,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:11,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:11,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:11,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:11,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:11,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:11,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:11,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:11,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:11,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:11,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:11,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:11,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:11,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:11,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:11,258 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:11,265 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:11,265 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:11,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:11,306 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:11,306 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:11,307 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:11,355 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:11,360 INFO L393 LassoCheck]: Loop: "main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;" "assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1;" [2020-07-29 01:28:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:11,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:11,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:11,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {994#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {994#unseeded} is VALID [2020-07-29 01:28:11,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {994#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {994#unseeded} is VALID [2020-07-29 01:28:11,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {994#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {994#unseeded} is VALID [2020-07-29 01:28:11,395 INFO L280 TraceCheckUtils]: 3: Hoare triple {994#unseeded} assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; {994#unseeded} is VALID [2020-07-29 01:28:11,396 INFO L280 TraceCheckUtils]: 4: Hoare triple {994#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {994#unseeded} is VALID [2020-07-29 01:28:11,397 INFO L280 TraceCheckUtils]: 5: Hoare triple {994#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {994#unseeded} is VALID [2020-07-29 01:28:11,397 INFO L280 TraceCheckUtils]: 6: Hoare triple {994#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {994#unseeded} is VALID [2020-07-29 01:28:11,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {994#unseeded} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {994#unseeded} is VALID [2020-07-29 01:28:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:11,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:11,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:11,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {997#(>= oldRank0 ULTIMATE.start_main_~y~0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {997#(>= oldRank0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:28:11,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {997#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1036#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:28:11,426 INFO L280 TraceCheckUtils]: 2: Hoare triple {1036#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {1036#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:28:11,427 INFO L280 TraceCheckUtils]: 3: Hoare triple {1036#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {1007#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:11,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:11,436 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:28:11,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:11,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,437 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:11,437 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 63 transitions. cyclomatic complexity: 28 Second operand 4 states. [2020-07-29 01:28:11,489 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 63 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 106 states and 158 transitions. Complement of second has 7 states. [2020-07-29 01:28:11,489 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:28:11,490 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:11,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 63 transitions. cyclomatic complexity: 28 [2020-07-29 01:28:11,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:11,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:11,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:11,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:11,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:11,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:11,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 158 transitions. [2020-07-29 01:28:11,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:28:11,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:11,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:11,494 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 63 transitions. cyclomatic complexity: 28 [2020-07-29 01:28:11,495 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:28:11,495 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:11,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:11,497 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:11,497 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 106 states and 158 transitions. cyclomatic complexity: 65 [2020-07-29 01:28:11,498 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:28:11,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:11,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:11,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:11,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:11,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:11,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:11,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:28:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:28:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:28:11,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:28:11,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:28:11,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:28:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:11,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:11,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:11,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:11,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:11,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:11,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:11,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:11,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:11,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:11,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:11,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:11,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:11,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:11,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:11,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:11,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:11,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:11,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:11,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:11,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:11,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:11,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:11,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:11,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:11,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:11,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:11,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:11,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:11,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:11,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:11,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:11,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:11,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:11,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:11,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 63 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 158 transitions. cyclomatic complexity: 65 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:11,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,534 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:28:11,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:11,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:11,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:11,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:11,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 158 transitions. cyclomatic complexity: 65 [2020-07-29 01:28:11,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:28:11,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 90 states and 129 transitions. [2020-07-29 01:28:11,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-07-29 01:28:11,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-07-29 01:28:11,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 129 transitions. [2020-07-29 01:28:11,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:11,546 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 129 transitions. [2020-07-29 01:28:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 129 transitions. [2020-07-29 01:28:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2020-07-29 01:28:11,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:11,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states and 129 transitions. Second operand 75 states. [2020-07-29 01:28:11,552 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states and 129 transitions. Second operand 75 states. [2020-07-29 01:28:11,552 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand 75 states. [2020-07-29 01:28:11,553 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:11,557 INFO L93 Difference]: Finished difference Result 95 states and 135 transitions. [2020-07-29 01:28:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2020-07-29 01:28:11,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:11,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:11,559 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 90 states and 129 transitions. [2020-07-29 01:28:11,559 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 90 states and 129 transitions. [2020-07-29 01:28:11,559 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:11,564 INFO L93 Difference]: Finished difference Result 100 states and 141 transitions. [2020-07-29 01:28:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2020-07-29 01:28:11,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:11,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:11,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:11,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-29 01:28:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2020-07-29 01:28:11,568 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2020-07-29 01:28:11,568 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2020-07-29 01:28:11,568 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:28:11,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. [2020-07-29 01:28:11,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:28:11,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:11,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:11,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:28:11,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:11,570 INFO L794 eck$LassoCheckResult]: Stem: 1167#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 1168#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1177#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1178#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 1194#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1193#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1191#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1189#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1188#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1187#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1183#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1184#L33 [2020-07-29 01:28:11,571 INFO L796 eck$LassoCheckResult]: Loop: 1184#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 1159#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1160#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1228#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1184#L33 [2020-07-29 01:28:11,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:11,571 INFO L82 PathProgramCache]: Analyzing trace with hash -369493663, now seen corresponding path program 2 times [2020-07-29 01:28:11,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:11,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350220766] [2020-07-29 01:28:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:11,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:11,585 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:11,588 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:11,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:11,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1696497, now seen corresponding path program 2 times [2020-07-29 01:28:11,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:11,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630060799] [2020-07-29 01:28:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:11,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:11,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:11,597 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -4707247, now seen corresponding path program 1 times [2020-07-29 01:28:11,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:11,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920802112] [2020-07-29 01:28:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:11,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:11,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:11,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:11,655 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:11,656 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:11,656 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:11,656 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:11,656 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:11,656 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:11,657 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:11,657 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:11,657 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration6_Loop [2020-07-29 01:28:11,657 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:11,657 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:11,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:28:11,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:11,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:11,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:11,819 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:11,819 INFO L404 LassoAnalysis]: Checking for nontermination... 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:28:11,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:11,830 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:11,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:11,875 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:11,976 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:11,977 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:11,978 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:11,978 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:11,978 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:11,978 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:11,978 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:11,978 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:11,978 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:11,978 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration6_Loop [2020-07-29 01:28:11,978 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:11,978 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:11,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:11,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:12,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:12,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:12,122 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:12,122 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:12,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:12,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:12,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:12,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:12,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:12,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:12,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:12,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:12,141 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:12,146 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:12,146 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:12,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:12,158 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:12,158 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:12,158 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:12,178 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:12,180 INFO L393 LassoCheck]: Loop: "assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1;" "main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;" [2020-07-29 01:28:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:12,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {1572#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {1572#unseeded} is VALID [2020-07-29 01:28:12,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {1572#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1572#unseeded} is VALID [2020-07-29 01:28:12,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {1572#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {1572#unseeded} is VALID [2020-07-29 01:28:12,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {1572#unseeded} assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; {1572#unseeded} is VALID [2020-07-29 01:28:12,219 INFO L280 TraceCheckUtils]: 4: Hoare triple {1572#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {1572#unseeded} is VALID [2020-07-29 01:28:12,219 INFO L280 TraceCheckUtils]: 5: Hoare triple {1572#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1572#unseeded} is VALID [2020-07-29 01:28:12,220 INFO L280 TraceCheckUtils]: 6: Hoare triple {1572#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {1572#unseeded} is VALID [2020-07-29 01:28:12,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {1572#unseeded} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {1572#unseeded} is VALID [2020-07-29 01:28:12,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {1572#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {1572#unseeded} is VALID [2020-07-29 01:28:12,221 INFO L280 TraceCheckUtils]: 9: Hoare triple {1572#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1572#unseeded} is VALID [2020-07-29 01:28:12,222 INFO L280 TraceCheckUtils]: 10: Hoare triple {1572#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {1572#unseeded} is VALID [2020-07-29 01:28:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:12,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {1575#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {1620#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:12,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {1620#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {1620#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:12,288 INFO L280 TraceCheckUtils]: 2: Hoare triple {1620#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1627#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:12,289 INFO L280 TraceCheckUtils]: 3: Hoare triple {1627#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {1585#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:12,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:12,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:12,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,299 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:28:12,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2020-07-29 01:28:12,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 112 states and 173 transitions. Complement of second has 7 states. [2020-07-29 01:28:12,367 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:28:12,368 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:12,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. cyclomatic complexity: 48 [2020-07-29 01:28:12,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:12,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:12,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 173 transitions. [2020-07-29 01:28:12,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:28:12,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,371 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 75 states and 111 transitions. cyclomatic complexity: 48 [2020-07-29 01:28:12,372 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:28:12,372 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:12,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:12,373 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:12,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 112 states and 173 transitions. cyclomatic complexity: 74 [2020-07-29 01:28:12,374 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:28:12,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 112 letters. Loop has 112 letters. [2020-07-29 01:28:12,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 112 letters. Loop has 112 letters. [2020-07-29 01:28:12,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 112 letters. Loop has 112 letters. [2020-07-29 01:28:12,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:28:12,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:28:12,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:28:12,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:12,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:12,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:12,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 173 transitions. cyclomatic complexity: 74 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,396 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-29 01:28:12,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,397 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:12,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:12,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {1572#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {1572#unseeded} is VALID [2020-07-29 01:28:12,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {1572#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1572#unseeded} is VALID [2020-07-29 01:28:12,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {1572#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {1572#unseeded} is VALID [2020-07-29 01:28:12,444 INFO L280 TraceCheckUtils]: 3: Hoare triple {1572#unseeded} assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; {1572#unseeded} is VALID [2020-07-29 01:28:12,445 INFO L280 TraceCheckUtils]: 4: Hoare triple {1572#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {1572#unseeded} is VALID [2020-07-29 01:28:12,446 INFO L280 TraceCheckUtils]: 5: Hoare triple {1572#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1572#unseeded} is VALID [2020-07-29 01:28:12,447 INFO L280 TraceCheckUtils]: 6: Hoare triple {1572#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {1572#unseeded} is VALID [2020-07-29 01:28:12,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {1572#unseeded} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {1572#unseeded} is VALID [2020-07-29 01:28:12,452 INFO L280 TraceCheckUtils]: 8: Hoare triple {1572#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {1572#unseeded} is VALID [2020-07-29 01:28:12,454 INFO L280 TraceCheckUtils]: 9: Hoare triple {1572#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1572#unseeded} is VALID [2020-07-29 01:28:12,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {1572#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {1572#unseeded} is VALID [2020-07-29 01:28:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:12,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {1575#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {1787#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:12,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {1787#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {1787#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:12,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {1787#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1794#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:12,512 INFO L280 TraceCheckUtils]: 3: Hoare triple {1794#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {1585#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:12,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:12,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:12,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,526 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:28:12,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2020-07-29 01:28:12,583 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 107 states and 160 transitions. Complement of second has 7 states. [2020-07-29 01:28:12,583 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:28:12,583 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:12,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. cyclomatic complexity: 48 [2020-07-29 01:28:12,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:12,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:12,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 160 transitions. [2020-07-29 01:28:12,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:28:12,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,586 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 75 states and 111 transitions. cyclomatic complexity: 48 [2020-07-29 01:28:12,586 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:28:12,586 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:12,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:12,587 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:12,587 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 107 states and 160 transitions. cyclomatic complexity: 66 [2020-07-29 01:28:12,589 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:28:12,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 107 letters. Loop has 107 letters. [2020-07-29 01:28:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 107 letters. Loop has 107 letters. [2020-07-29 01:28:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 107 letters. Loop has 107 letters. [2020-07-29 01:28:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:28:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:28:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:28:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 160 transitions. cyclomatic complexity: 66 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,610 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:28:12,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,611 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:12,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {1572#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {1572#unseeded} is VALID [2020-07-29 01:28:12,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {1572#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1572#unseeded} is VALID [2020-07-29 01:28:12,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {1572#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {1572#unseeded} is VALID [2020-07-29 01:28:12,640 INFO L280 TraceCheckUtils]: 3: Hoare triple {1572#unseeded} assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; {1572#unseeded} is VALID [2020-07-29 01:28:12,641 INFO L280 TraceCheckUtils]: 4: Hoare triple {1572#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {1572#unseeded} is VALID [2020-07-29 01:28:12,645 INFO L280 TraceCheckUtils]: 5: Hoare triple {1572#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1572#unseeded} is VALID [2020-07-29 01:28:12,645 INFO L280 TraceCheckUtils]: 6: Hoare triple {1572#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {1572#unseeded} is VALID [2020-07-29 01:28:12,646 INFO L280 TraceCheckUtils]: 7: Hoare triple {1572#unseeded} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {1572#unseeded} is VALID [2020-07-29 01:28:12,646 INFO L280 TraceCheckUtils]: 8: Hoare triple {1572#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {1572#unseeded} is VALID [2020-07-29 01:28:12,647 INFO L280 TraceCheckUtils]: 9: Hoare triple {1572#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1572#unseeded} is VALID [2020-07-29 01:28:12,647 INFO L280 TraceCheckUtils]: 10: Hoare triple {1572#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {1572#unseeded} is VALID [2020-07-29 01:28:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:12,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:12,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {1575#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {1949#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:12,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {1949#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {1949#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:12,705 INFO L280 TraceCheckUtils]: 2: Hoare triple {1949#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {1956#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:12,706 INFO L280 TraceCheckUtils]: 3: Hoare triple {1956#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {1585#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:12,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:12,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:12,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,714 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:28:12,714 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2020-07-29 01:28:12,778 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 128 states and 203 transitions. Complement of second has 8 states. [2020-07-29 01:28:12,779 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:28:12,779 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:12,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. cyclomatic complexity: 48 [2020-07-29 01:28:12,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:12,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:12,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 203 transitions. [2020-07-29 01:28:12,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-07-29 01:28:12,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,783 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 75 states and 111 transitions. cyclomatic complexity: 48 [2020-07-29 01:28:12,783 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:28:12,783 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:12,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:12,784 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:12,784 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 128 states and 203 transitions. cyclomatic complexity: 88 [2020-07-29 01:28:12,786 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:28:12,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:28:12,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:28:12,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:28:12,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:28:12,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:28:12,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 75 letters. Loop has 75 letters. [2020-07-29 01:28:12,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:12,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:12,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:12,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:12,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:12,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:28:12,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:28:12,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:28:12,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:12,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:12,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:12,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:28:12,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:28:12,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:28:12,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 111 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 203 transitions. cyclomatic complexity: 88 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,810 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-29 01:28:12,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:12,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:12,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:12,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:12,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 203 transitions. cyclomatic complexity: 88 [2020-07-29 01:28:12,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-07-29 01:28:12,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 97 states and 147 transitions. [2020-07-29 01:28:12,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-07-29 01:28:12,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-07-29 01:28:12,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 147 transitions. [2020-07-29 01:28:12,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:12,819 INFO L688 BuchiCegarLoop]: Abstraction has 97 states and 147 transitions. [2020-07-29 01:28:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 147 transitions. [2020-07-29 01:28:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2020-07-29 01:28:12,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:12,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states and 147 transitions. Second operand 66 states. [2020-07-29 01:28:12,824 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states and 147 transitions. Second operand 66 states. [2020-07-29 01:28:12,824 INFO L87 Difference]: Start difference. First operand 97 states and 147 transitions. Second operand 66 states. [2020-07-29 01:28:12,824 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:12,828 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2020-07-29 01:28:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2020-07-29 01:28:12,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:12,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:12,829 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 97 states and 147 transitions. [2020-07-29 01:28:12,829 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 97 states and 147 transitions. [2020-07-29 01:28:12,833 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:12,837 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2020-07-29 01:28:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2020-07-29 01:28:12,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:12,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:12,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:12,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-29 01:28:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 100 transitions. [2020-07-29 01:28:12,840 INFO L711 BuchiCegarLoop]: Abstraction has 66 states and 100 transitions. [2020-07-29 01:28:12,840 INFO L591 BuchiCegarLoop]: Abstraction has 66 states and 100 transitions. [2020-07-29 01:28:12,840 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:28:12,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 100 transitions. [2020-07-29 01:28:12,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-07-29 01:28:12,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:12,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:12,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-07-29 01:28:12,841 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:28:12,842 INFO L794 eck$LassoCheckResult]: Stem: 2106#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 2107#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2129#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 2130#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 2133#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 2132#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2115#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 2108#L33 [2020-07-29 01:28:12,842 INFO L796 eck$LassoCheckResult]: Loop: 2108#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 2099#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 2100#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2112#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 2101#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 2102#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 2113#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2164#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 2108#L33 [2020-07-29 01:28:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1365800207, now seen corresponding path program 1 times [2020-07-29 01:28:12,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:12,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115569499] [2020-07-29 01:28:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:12,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:12,859 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:12,863 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -920272584, now seen corresponding path program 1 times [2020-07-29 01:28:12,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:12,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205674927] [2020-07-29 01:28:12,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:12,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:12,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:12,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:12,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:12,898 INFO L82 PathProgramCache]: Analyzing trace with hash -725918680, now seen corresponding path program 1 times [2020-07-29 01:28:12,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:12,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950809949] [2020-07-29 01:28:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:12,909 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:12,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:12,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:13,012 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:13,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:13,012 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:13,013 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:13,013 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:13,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:13,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:13,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:13,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration7_Loop [2020-07-29 01:28:13,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:13,013 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:13,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:13,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:13,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:28:13,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:13,174 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:13,175 INFO L404 LassoAnalysis]: Checking for nontermination... 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:28:13,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:13,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:13,190 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:13,190 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=-5} Honda state: {ULTIMATE.start_main_#t~nondet2=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:13,211 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:13,211 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:13,214 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:13,214 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:13,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:13,237 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:13,240 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:13,240 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 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:28:13,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:13,263 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:13,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:13,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:13,481 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:13,482 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:13,482 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:13,482 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:13,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:13,483 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:13,483 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:13,483 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:13,483 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:13,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration7_Loop [2020-07-29 01:28:13,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:13,483 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:13,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:13,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:13,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:13,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:13,657 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:13,658 INFO L489 LassoAnalysis]: Using template 'affine'. 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:28:13,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:13,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:13,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:13,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:13,662 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:13,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:13,663 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:13,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:13,666 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 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:28:13,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:13,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:13,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:13,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:13,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:13,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:13,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:13,696 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 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:28:13,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:13,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:13,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:13,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:13,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:13,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:13,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:13,728 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 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:28:13,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:13,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:13,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:13,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:13,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:13,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:13,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:13,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:13,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:13,764 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:28:13,764 INFO L444 ModelExtractionUtils]: 4 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:13,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:13,768 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:13,768 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:13,768 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-07-29 01:28:13,791 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:13,794 INFO L393 LassoCheck]: Loop: "assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1;" "main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;" "assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1;" "main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;" [2020-07-29 01:28:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:13,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:13,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:13,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:13,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {2534#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {2534#unseeded} is VALID [2020-07-29 01:28:13,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {2534#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {2534#unseeded} is VALID [2020-07-29 01:28:13,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {2534#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {2534#unseeded} is VALID [2020-07-29 01:28:13,833 INFO L280 TraceCheckUtils]: 3: Hoare triple {2534#unseeded} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {2534#unseeded} is VALID [2020-07-29 01:28:13,834 INFO L280 TraceCheckUtils]: 4: Hoare triple {2534#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {2534#unseeded} is VALID [2020-07-29 01:28:13,835 INFO L280 TraceCheckUtils]: 5: Hoare triple {2534#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {2534#unseeded} is VALID [2020-07-29 01:28:13,835 INFO L280 TraceCheckUtils]: 6: Hoare triple {2534#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {2534#unseeded} is VALID [2020-07-29 01:28:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:13,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:13,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:13,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {2537#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {2570#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:13,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {2570#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {2570#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:13,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {2570#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {2570#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:13,991 INFO L280 TraceCheckUtils]: 3: Hoare triple {2570#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {2570#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:13,992 INFO L280 TraceCheckUtils]: 4: Hoare triple {2570#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {2583#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} is VALID [2020-07-29 01:28:13,993 INFO L280 TraceCheckUtils]: 5: Hoare triple {2583#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {2583#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} is VALID [2020-07-29 01:28:13,993 INFO L280 TraceCheckUtils]: 6: Hoare triple {2583#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {2590#(and (< 0 ULTIMATE.start_main_~y~0) (<= (+ ULTIMATE.start_main_~y~0 3) oldRank0))} is VALID [2020-07-29 01:28:13,994 INFO L280 TraceCheckUtils]: 7: Hoare triple {2590#(and (< 0 ULTIMATE.start_main_~y~0) (<= (+ ULTIMATE.start_main_~y~0 3) oldRank0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {2547#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:13,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:28:14,008 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:28:14,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:14,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,009 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:28:14,009 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 100 transitions. cyclomatic complexity: 43 Second operand 5 states. [2020-07-29 01:28:14,227 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 100 transitions. cyclomatic complexity: 43. Second operand 5 states. Result 246 states and 366 transitions. Complement of second has 13 states. [2020-07-29 01:28:14,228 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:28:14,228 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:14,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 100 transitions. cyclomatic complexity: 43 [2020-07-29 01:28:14,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:14,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:14,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:28:14,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:14,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:14,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:14,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 366 transitions. [2020-07-29 01:28:14,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2020-07-29 01:28:14,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:14,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:14,233 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 100 transitions. cyclomatic complexity: 43 [2020-07-29 01:28:14,235 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:28:14,235 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:28:14,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:14,236 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:14,236 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 246 states and 366 transitions. cyclomatic complexity: 148 [2020-07-29 01:28:14,238 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2020-07-29 01:28:14,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:14,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:14,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:14,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:14,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:14,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:14,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 246 letters. Loop has 246 letters. [2020-07-29 01:28:14,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 246 letters. Loop has 246 letters. [2020-07-29 01:28:14,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 246 letters. Loop has 246 letters. [2020-07-29 01:28:14,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 66 letters. Loop has 66 letters. [2020-07-29 01:28:14,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 66 letters. Loop has 66 letters. [2020-07-29 01:28:14,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 66 letters. Loop has 66 letters. [2020-07-29 01:28:14,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:14,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:14,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:14,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:14,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:14,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:14,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:14,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:14,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:14,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:14,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:14,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:14,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:14,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:14,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:14,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:14,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:14,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:14,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:14,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:14,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:14,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 100 transitions. cyclomatic complexity: 43 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:14,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:14,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 246 states and 366 transitions. cyclomatic complexity: 148 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:14,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,299 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:28:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-29 01:28:14,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:14,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:28:14,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 16 letters. [2020-07-29 01:28:14,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:14,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 366 transitions. cyclomatic complexity: 148 [2020-07-29 01:28:14,308 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2020-07-29 01:28:14,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 208 states and 314 transitions. [2020-07-29 01:28:14,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-07-29 01:28:14,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2020-07-29 01:28:14,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 314 transitions. [2020-07-29 01:28:14,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:14,315 INFO L688 BuchiCegarLoop]: Abstraction has 208 states and 314 transitions. [2020-07-29 01:28:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 314 transitions. [2020-07-29 01:28:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 188. [2020-07-29 01:28:14,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:14,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states and 314 transitions. Second operand 188 states. [2020-07-29 01:28:14,326 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states and 314 transitions. Second operand 188 states. [2020-07-29 01:28:14,326 INFO L87 Difference]: Start difference. First operand 208 states and 314 transitions. Second operand 188 states. [2020-07-29 01:28:14,327 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:14,334 INFO L93 Difference]: Finished difference Result 235 states and 345 transitions. [2020-07-29 01:28:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 345 transitions. [2020-07-29 01:28:14,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:14,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:14,335 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 208 states and 314 transitions. [2020-07-29 01:28:14,335 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 208 states and 314 transitions. [2020-07-29 01:28:14,336 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:14,343 INFO L93 Difference]: Finished difference Result 242 states and 357 transitions. [2020-07-29 01:28:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2020-07-29 01:28:14,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:14,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:14,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:14,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-07-29 01:28:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2020-07-29 01:28:14,358 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 287 transitions. [2020-07-29 01:28:14,358 INFO L591 BuchiCegarLoop]: Abstraction has 188 states and 287 transitions. [2020-07-29 01:28:14,358 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:28:14,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 287 transitions. [2020-07-29 01:28:14,362 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2020-07-29 01:28:14,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:14,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:14,363 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:28:14,363 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:28:14,366 INFO L794 eck$LassoCheckResult]: Stem: 2867#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 2868#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2914#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 2912#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 2903#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 2899#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2900#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 2913#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 2893#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 2888#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2889#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 2987#L33 [2020-07-29 01:28:14,366 INFO L796 eck$LassoCheckResult]: Loop: 2987#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 2954#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 2955#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2934#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 2936#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 2988#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 2917#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2918#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 2987#L33 [2020-07-29 01:28:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:14,367 INFO L82 PathProgramCache]: Analyzing trace with hash -369493663, now seen corresponding path program 3 times [2020-07-29 01:28:14,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:14,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478681807] [2020-07-29 01:28:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:14,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:14,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:14,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash -920272584, now seen corresponding path program 2 times [2020-07-29 01:28:14,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:14,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513753133] [2020-07-29 01:28:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:14,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:14,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:14,407 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:14,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:14,407 INFO L82 PathProgramCache]: Analyzing trace with hash -742368616, now seen corresponding path program 2 times [2020-07-29 01:28:14,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:14,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113883580] [2020-07-29 01:28:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:14,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:14,435 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:14,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:14,522 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:14,522 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:14,522 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:14,522 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:14,522 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:14,522 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:14,522 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:14,523 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:14,523 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration8_Loop [2020-07-29 01:28:14,523 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:14,523 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:14,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:14,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:14,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:14,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:14,683 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:14,684 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 01:28:14,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:14,693 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:14,697 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:14,698 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 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:28:14,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:14,727 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:28:14,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:14,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:14,923 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:14,924 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:14,924 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:14,924 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:14,925 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:14,925 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:14,925 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:14,925 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:14,925 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:14,925 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration8_Loop [2020-07-29 01:28:14,925 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:14,925 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:14,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:14,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:14,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:28:14,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:15,091 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:15,091 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:15,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:15,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:15,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:15,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:15,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:15,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:15,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:15,101 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 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:28:15,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:15,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:15,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:15,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:15,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:15,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:15,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:15,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:15,130 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:15,132 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:28:15,132 INFO L444 ModelExtractionUtils]: 4 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:15,135 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:15,135 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:15,135 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:15,135 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-07-29 01:28:15,158 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:15,161 INFO L393 LassoCheck]: Loop: "assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1;" "main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;" "assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1;" "main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;" [2020-07-29 01:28:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:15,200 INFO L280 TraceCheckUtils]: 0: Hoare triple {3815#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {3815#unseeded} is VALID [2020-07-29 01:28:15,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {3815#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3815#unseeded} is VALID [2020-07-29 01:28:15,202 INFO L280 TraceCheckUtils]: 2: Hoare triple {3815#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {3815#unseeded} is VALID [2020-07-29 01:28:15,202 INFO L280 TraceCheckUtils]: 3: Hoare triple {3815#unseeded} assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; {3815#unseeded} is VALID [2020-07-29 01:28:15,203 INFO L280 TraceCheckUtils]: 4: Hoare triple {3815#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {3815#unseeded} is VALID [2020-07-29 01:28:15,204 INFO L280 TraceCheckUtils]: 5: Hoare triple {3815#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3815#unseeded} is VALID [2020-07-29 01:28:15,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {3815#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {3815#unseeded} is VALID [2020-07-29 01:28:15,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {3815#unseeded} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {3815#unseeded} is VALID [2020-07-29 01:28:15,211 INFO L280 TraceCheckUtils]: 8: Hoare triple {3815#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {3815#unseeded} is VALID [2020-07-29 01:28:15,211 INFO L280 TraceCheckUtils]: 9: Hoare triple {3815#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3815#unseeded} is VALID [2020-07-29 01:28:15,212 INFO L280 TraceCheckUtils]: 10: Hoare triple {3815#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {3815#unseeded} is VALID [2020-07-29 01:28:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:15,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {3818#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {3863#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:15,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {3863#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {3863#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:15,342 INFO L280 TraceCheckUtils]: 2: Hoare triple {3863#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3863#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:15,343 INFO L280 TraceCheckUtils]: 3: Hoare triple {3863#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {3863#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:15,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {3863#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {3876#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} is VALID [2020-07-29 01:28:15,344 INFO L280 TraceCheckUtils]: 5: Hoare triple {3876#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {3876#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} is VALID [2020-07-29 01:28:15,345 INFO L280 TraceCheckUtils]: 6: Hoare triple {3876#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3883#(and (< 0 ULTIMATE.start_main_~y~0) (<= (+ ULTIMATE.start_main_~y~0 3) oldRank0))} is VALID [2020-07-29 01:28:15,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {3883#(and (< 0 ULTIMATE.start_main_~y~0) (<= (+ ULTIMATE.start_main_~y~0 3) oldRank0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {3828#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:15,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:28:15,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:15,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,366 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:28:15,366 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2020-07-29 01:28:15,538 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 330 states and 503 transitions. Complement of second has 13 states. [2020-07-29 01:28:15,538 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:28:15,538 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:15,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 287 transitions. cyclomatic complexity: 124 [2020-07-29 01:28:15,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:15,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:15,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:28:15,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:15,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:15,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:15,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 330 states and 503 transitions. [2020-07-29 01:28:15,541 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2020-07-29 01:28:15,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:15,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:15,542 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 188 states and 287 transitions. cyclomatic complexity: 124 [2020-07-29 01:28:15,545 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2020-07-29 01:28:15,545 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:28:15,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:15,546 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:15,546 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 330 states and 503 transitions. cyclomatic complexity: 215 [2020-07-29 01:28:15,552 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2020-07-29 01:28:15,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:15,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:15,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:15,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 330 letters. Loop has 330 letters. [2020-07-29 01:28:15,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 330 letters. Loop has 330 letters. [2020-07-29 01:28:15,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 330 letters. Loop has 330 letters. [2020-07-29 01:28:15,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 188 letters. Loop has 188 letters. [2020-07-29 01:28:15,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 188 letters. Loop has 188 letters. [2020-07-29 01:28:15,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 188 letters. Loop has 188 letters. [2020-07-29 01:28:15,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:15,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:15,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:15,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:15,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:15,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:15,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:15,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:15,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:15,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:15,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:15,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 330 states and 503 transitions. cyclomatic complexity: 215 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:15,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,584 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:28:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-29 01:28:15,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,585 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:15,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:15,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {3815#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {3815#unseeded} is VALID [2020-07-29 01:28:15,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {3815#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3815#unseeded} is VALID [2020-07-29 01:28:15,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {3815#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {3815#unseeded} is VALID [2020-07-29 01:28:15,618 INFO L280 TraceCheckUtils]: 3: Hoare triple {3815#unseeded} assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; {3815#unseeded} is VALID [2020-07-29 01:28:15,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {3815#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {3815#unseeded} is VALID [2020-07-29 01:28:15,619 INFO L280 TraceCheckUtils]: 5: Hoare triple {3815#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3815#unseeded} is VALID [2020-07-29 01:28:15,621 INFO L280 TraceCheckUtils]: 6: Hoare triple {3815#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {3815#unseeded} is VALID [2020-07-29 01:28:15,621 INFO L280 TraceCheckUtils]: 7: Hoare triple {3815#unseeded} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {3815#unseeded} is VALID [2020-07-29 01:28:15,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {3815#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {3815#unseeded} is VALID [2020-07-29 01:28:15,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {3815#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3815#unseeded} is VALID [2020-07-29 01:28:15,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {3815#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {3815#unseeded} is VALID [2020-07-29 01:28:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:15,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {3818#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {4272#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:15,730 INFO L280 TraceCheckUtils]: 1: Hoare triple {4272#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {4272#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:15,731 INFO L280 TraceCheckUtils]: 2: Hoare triple {4272#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {4272#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:15,731 INFO L280 TraceCheckUtils]: 3: Hoare triple {4272#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {4272#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:15,732 INFO L280 TraceCheckUtils]: 4: Hoare triple {4272#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {4285#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} is VALID [2020-07-29 01:28:15,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {4285#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {4285#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} is VALID [2020-07-29 01:28:15,733 INFO L280 TraceCheckUtils]: 6: Hoare triple {4285#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {4292#(and (< 0 ULTIMATE.start_main_~y~0) (<= (+ ULTIMATE.start_main_~y~0 3) oldRank0))} is VALID [2020-07-29 01:28:15,734 INFO L280 TraceCheckUtils]: 7: Hoare triple {4292#(and (< 0 ULTIMATE.start_main_~y~0) (<= (+ ULTIMATE.start_main_~y~0 3) oldRank0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {3828#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:15,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:28:15,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:15,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,746 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:28:15,746 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2020-07-29 01:28:15,930 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 326 states and 483 transitions. Complement of second has 15 states. [2020-07-29 01:28:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:15,931 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:15,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 287 transitions. cyclomatic complexity: 124 [2020-07-29 01:28:15,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:15,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:15,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:28:15,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:15,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:15,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:15,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 483 transitions. [2020-07-29 01:28:15,935 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2020-07-29 01:28:15,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:15,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:15,936 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 188 states and 287 transitions. cyclomatic complexity: 124 [2020-07-29 01:28:15,936 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2020-07-29 01:28:15,936 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:28:15,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:15,937 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:15,937 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 326 states and 483 transitions. cyclomatic complexity: 199 [2020-07-29 01:28:15,938 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2020-07-29 01:28:15,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:15,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:15,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:15,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 326 letters. Loop has 326 letters. [2020-07-29 01:28:15,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 326 letters. Loop has 326 letters. [2020-07-29 01:28:15,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 326 letters. Loop has 326 letters. [2020-07-29 01:28:15,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 188 letters. Loop has 188 letters. [2020-07-29 01:28:15,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 188 letters. Loop has 188 letters. [2020-07-29 01:28:15,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 188 letters. Loop has 188 letters. [2020-07-29 01:28:15,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:15,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:15,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:15,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:15,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:15,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:15,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:15,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:15,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:15,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:15,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:15,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:15,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:15,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 326 states and 483 transitions. cyclomatic complexity: 199 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:15,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,970 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:28:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-29 01:28:15,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:15,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:15,971 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:15,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:16,000 INFO L280 TraceCheckUtils]: 0: Hoare triple {3815#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {3815#unseeded} is VALID [2020-07-29 01:28:16,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {3815#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3815#unseeded} is VALID [2020-07-29 01:28:16,001 INFO L280 TraceCheckUtils]: 2: Hoare triple {3815#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {3815#unseeded} is VALID [2020-07-29 01:28:16,005 INFO L280 TraceCheckUtils]: 3: Hoare triple {3815#unseeded} assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; {3815#unseeded} is VALID [2020-07-29 01:28:16,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {3815#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {3815#unseeded} is VALID [2020-07-29 01:28:16,007 INFO L280 TraceCheckUtils]: 5: Hoare triple {3815#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3815#unseeded} is VALID [2020-07-29 01:28:16,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {3815#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {3815#unseeded} is VALID [2020-07-29 01:28:16,008 INFO L280 TraceCheckUtils]: 7: Hoare triple {3815#unseeded} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {3815#unseeded} is VALID [2020-07-29 01:28:16,008 INFO L280 TraceCheckUtils]: 8: Hoare triple {3815#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {3815#unseeded} is VALID [2020-07-29 01:28:16,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {3815#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {3815#unseeded} is VALID [2020-07-29 01:28:16,009 INFO L280 TraceCheckUtils]: 10: Hoare triple {3815#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {3815#unseeded} is VALID [2020-07-29 01:28:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:16,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:16,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:16,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {3818#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {4680#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:16,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {4680#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {4680#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:16,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {4680#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {4680#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:16,135 INFO L280 TraceCheckUtils]: 3: Hoare triple {4680#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {4680#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} is VALID [2020-07-29 01:28:16,136 INFO L280 TraceCheckUtils]: 4: Hoare triple {4680#(<= (+ ULTIMATE.start_main_~x~0 2) oldRank0)} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {4693#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} is VALID [2020-07-29 01:28:16,137 INFO L280 TraceCheckUtils]: 5: Hoare triple {4693#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {4693#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} is VALID [2020-07-29 01:28:16,137 INFO L280 TraceCheckUtils]: 6: Hoare triple {4693#(<= (+ ULTIMATE.start_main_~y~0 3) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {4700#(and (< 0 ULTIMATE.start_main_~y~0) (<= (+ ULTIMATE.start_main_~y~0 3) oldRank0))} is VALID [2020-07-29 01:28:16,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {4700#(and (< 0 ULTIMATE.start_main_~y~0) (<= (+ ULTIMATE.start_main_~y~0 3) oldRank0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {3828#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:16,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:28:16,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:16,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,150 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:28:16,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2020-07-29 01:28:16,371 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 525 states and 786 transitions. Complement of second has 23 states. [2020-07-29 01:28:16,372 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:28:16,372 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:16,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 287 transitions. cyclomatic complexity: 124 [2020-07-29 01:28:16,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:16,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:16,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:28:16,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:16,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:16,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:16,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 525 states and 786 transitions. [2020-07-29 01:28:16,378 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2020-07-29 01:28:16,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:16,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:16,379 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 188 states and 287 transitions. cyclomatic complexity: 124 [2020-07-29 01:28:16,380 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2020-07-29 01:28:16,380 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:28:16,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:16,381 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:16,381 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 525 states and 786 transitions. cyclomatic complexity: 315 [2020-07-29 01:28:16,384 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 30 examples of accepted words. [2020-07-29 01:28:16,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:16,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:16,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:16,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 525 letters. Loop has 525 letters. [2020-07-29 01:28:16,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 525 letters. Loop has 525 letters. [2020-07-29 01:28:16,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 525 letters. Loop has 525 letters. [2020-07-29 01:28:16,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 188 letters. Loop has 188 letters. [2020-07-29 01:28:16,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 188 letters. Loop has 188 letters. [2020-07-29 01:28:16,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 188 letters. Loop has 188 letters. [2020-07-29 01:28:16,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:16,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:16,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:16,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:16,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:16,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:16,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:16,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:16,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:16,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:16,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:16,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:28:16,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 12 letters. [2020-07-29 01:28:16,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 12 letters. [2020-07-29 01:28:16,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 15 letters. Loop has 12 letters. [2020-07-29 01:28:16,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 19 letters. Loop has 16 letters. [2020-07-29 01:28:16,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 16 letters. [2020-07-29 01:28:16,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 19 letters. Loop has 16 letters. [2020-07-29 01:28:16,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:28:16,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:28:16,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:28:16,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 22 letters. Loop has 4 letters. [2020-07-29 01:28:16,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 4 letters. [2020-07-29 01:28:16,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 22 letters. Loop has 4 letters. [2020-07-29 01:28:16,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 23 letters. Loop has 4 letters. [2020-07-29 01:28:16,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 4 letters. [2020-07-29 01:28:16,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 23 letters. Loop has 4 letters. [2020-07-29 01:28:16,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 20 letters. Loop has 4 letters. [2020-07-29 01:28:16,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 4 letters. [2020-07-29 01:28:16,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 20 letters. Loop has 4 letters. [2020-07-29 01:28:16,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:16,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:16,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:16,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 19 letters. Loop has 16 letters. [2020-07-29 01:28:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 16 letters. [2020-07-29 01:28:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 19 letters. Loop has 16 letters. [2020-07-29 01:28:16,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 22 letters. Loop has 4 letters. [2020-07-29 01:28:16,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 4 letters. [2020-07-29 01:28:16,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 22 letters. Loop has 4 letters. [2020-07-29 01:28:16,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:16,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:16,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 20 letters. Loop has 4 letters. [2020-07-29 01:28:16,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 4 letters. [2020-07-29 01:28:16,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 20 letters. Loop has 4 letters. [2020-07-29 01:28:16,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 23 letters. Loop has 4 letters. [2020-07-29 01:28:16,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 4 letters. [2020-07-29 01:28:16,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 23 letters. Loop has 4 letters. [2020-07-29 01:28:16,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 15 letters. Loop has 12 letters. [2020-07-29 01:28:16,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 12 letters. [2020-07-29 01:28:16,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 15 letters. Loop has 12 letters. [2020-07-29 01:28:16,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:28:16,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:28:16,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:28:16,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:16,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:16,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:16,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:16,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 287 transitions. cyclomatic complexity: 124 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 525 states and 786 transitions. cyclomatic complexity: 315 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:16,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,463 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:28:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2020-07-29 01:28:16,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:16,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 19 letters. Loop has 8 letters. [2020-07-29 01:28:16,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 16 letters. [2020-07-29 01:28:16,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:16,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 525 states and 786 transitions. cyclomatic complexity: 315 [2020-07-29 01:28:16,496 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2020-07-29 01:28:16,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 525 states to 342 states and 512 transitions. [2020-07-29 01:28:16,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-07-29 01:28:16,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2020-07-29 01:28:16,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 512 transitions. [2020-07-29 01:28:16,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:16,518 INFO L688 BuchiCegarLoop]: Abstraction has 342 states and 512 transitions. [2020-07-29 01:28:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 512 transitions. [2020-07-29 01:28:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 205. [2020-07-29 01:28:16,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:16,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states and 512 transitions. Second operand 205 states. [2020-07-29 01:28:16,529 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states and 512 transitions. Second operand 205 states. [2020-07-29 01:28:16,529 INFO L87 Difference]: Start difference. First operand 342 states and 512 transitions. Second operand 205 states. [2020-07-29 01:28:16,529 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:16,547 INFO L93 Difference]: Finished difference Result 389 states and 568 transitions. [2020-07-29 01:28:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 568 transitions. [2020-07-29 01:28:16,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:16,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:16,550 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 342 states and 512 transitions. [2020-07-29 01:28:16,550 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 342 states and 512 transitions. [2020-07-29 01:28:16,550 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:16,573 INFO L93 Difference]: Finished difference Result 403 states and 592 transitions. [2020-07-29 01:28:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 592 transitions. [2020-07-29 01:28:16,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:16,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:16,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:16,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-07-29 01:28:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2020-07-29 01:28:16,581 INFO L711 BuchiCegarLoop]: Abstraction has 205 states and 317 transitions. [2020-07-29 01:28:16,581 INFO L591 BuchiCegarLoop]: Abstraction has 205 states and 317 transitions. [2020-07-29 01:28:16,581 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:28:16,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 317 transitions. [2020-07-29 01:28:16,583 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2020-07-29 01:28:16,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:16,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:16,583 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-07-29 01:28:16,584 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:28:16,584 INFO L794 eck$LassoCheckResult]: Stem: 5265#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 5266#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 5297#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 5321#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 5342#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 5287#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 5280#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 5281#L33 [2020-07-29 01:28:16,584 INFO L796 eck$LassoCheckResult]: Loop: 5281#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 5399#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 5400#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 5435#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 5394#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 5434#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 5433#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 5393#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 5281#L33 [2020-07-29 01:28:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:16,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1365800207, now seen corresponding path program 2 times [2020-07-29 01:28:16,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:16,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492437470] [2020-07-29 01:28:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:16,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:16,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:16,595 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1729619210, now seen corresponding path program 1 times [2020-07-29 01:28:16,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:16,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637814706] [2020-07-29 01:28:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:16,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:16,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:16,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:16,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1535265306, now seen corresponding path program 1 times [2020-07-29 01:28:16,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:16,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917389540] [2020-07-29 01:28:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:16,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:16,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:16,628 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:16,734 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:16,734 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:16,734 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:16,734 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:16,734 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:16,734 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:16,735 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:16,735 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:16,735 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration9_Loop [2020-07-29 01:28:16,735 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:16,735 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:16,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:16,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:16,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:16,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:16,896 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:16,897 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 01:28:16,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:16,906 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:16,911 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:16,911 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:16,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:16,952 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:16,958 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:16,958 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=-5} Honda state: {ULTIMATE.start_main_#t~nondet2=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:28:16,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:16,983 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 59 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 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:28:17,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:17,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:17,098 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:17,099 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:17,100 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:17,100 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:17,100 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:17,100 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:17,101 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:17,101 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:17,101 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:17,101 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration9_Loop [2020-07-29 01:28:17,101 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:17,101 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:17,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:17,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:17,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:17,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:28:17,285 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:17,285 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:28:17,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:17,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:17,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:17,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:17,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:17,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:17,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:17,296 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 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:28:17,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:17,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:17,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:17,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:17,320 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:17,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:17,321 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:17,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:17,322 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 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:28:17,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:17,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:17,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:17,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:17,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:17,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:17,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:17,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:17,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:17,364 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:28:17,365 INFO L444 ModelExtractionUtils]: 4 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:17,369 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:17,369 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:17,369 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:17,369 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-07-29 01:28:17,392 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:17,395 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1;" "main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;" "assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1;" "main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;" [2020-07-29 01:28:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:17,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:17,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:17,426 INFO L280 TraceCheckUtils]: 0: Hoare triple {6658#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {6658#unseeded} is VALID [2020-07-29 01:28:17,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {6658#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {6658#unseeded} is VALID [2020-07-29 01:28:17,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {6658#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {6658#unseeded} is VALID [2020-07-29 01:28:17,427 INFO L280 TraceCheckUtils]: 3: Hoare triple {6658#unseeded} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {6658#unseeded} is VALID [2020-07-29 01:28:17,428 INFO L280 TraceCheckUtils]: 4: Hoare triple {6658#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {6658#unseeded} is VALID [2020-07-29 01:28:17,428 INFO L280 TraceCheckUtils]: 5: Hoare triple {6658#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {6658#unseeded} is VALID [2020-07-29 01:28:17,429 INFO L280 TraceCheckUtils]: 6: Hoare triple {6658#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {6658#unseeded} is VALID [2020-07-29 01:28:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:17,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:17,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:17,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {6661#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; {6694#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:17,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {6694#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {6694#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:17,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {6694#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {6694#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:17,524 INFO L280 TraceCheckUtils]: 3: Hoare triple {6694#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {6694#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} is VALID [2020-07-29 01:28:17,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {6694#(<= (+ ULTIMATE.start_main_~x~0 1) oldRank0)} assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; {6707#(<= (+ ULTIMATE.start_main_~y~0 2) oldRank0)} is VALID [2020-07-29 01:28:17,526 INFO L280 TraceCheckUtils]: 5: Hoare triple {6707#(<= (+ ULTIMATE.start_main_~y~0 2) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {6707#(<= (+ ULTIMATE.start_main_~y~0 2) oldRank0)} is VALID [2020-07-29 01:28:17,527 INFO L280 TraceCheckUtils]: 6: Hoare triple {6707#(<= (+ ULTIMATE.start_main_~y~0 2) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {6714#(and (<= (+ ULTIMATE.start_main_~y~0 2) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:28:17,527 INFO L280 TraceCheckUtils]: 7: Hoare triple {6714#(and (<= (+ ULTIMATE.start_main_~y~0 2) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {6671#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:17,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:28:17,537 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:28:17,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:17,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,538 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:28:17,538 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 205 states and 317 transitions. cyclomatic complexity: 133 Second operand 5 states. [2020-07-29 01:28:17,730 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 205 states and 317 transitions. cyclomatic complexity: 133. Second operand 5 states. Result 490 states and 759 transitions. Complement of second has 12 states. [2020-07-29 01:28:17,731 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:28:17,731 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:17,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 317 transitions. cyclomatic complexity: 133 [2020-07-29 01:28:17,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:17,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:17,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:28:17,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:17,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:17,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:17,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 490 states and 759 transitions. [2020-07-29 01:28:17,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:28:17,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:17,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:17,737 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 205 states and 317 transitions. cyclomatic complexity: 133 [2020-07-29 01:28:17,738 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 22 examples of accepted words. [2020-07-29 01:28:17,739 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:28:17,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:17,739 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:17,740 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 490 states and 759 transitions. cyclomatic complexity: 317 [2020-07-29 01:28:17,740 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:28:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:17,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:17,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:17,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 490 letters. Loop has 490 letters. [2020-07-29 01:28:17,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 490 letters. Loop has 490 letters. [2020-07-29 01:28:17,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 490 letters. Loop has 490 letters. [2020-07-29 01:28:17,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 205 letters. Loop has 205 letters. [2020-07-29 01:28:17,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 205 letters. Loop has 205 letters. [2020-07-29 01:28:17,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 205 letters. Loop has 205 letters. [2020-07-29 01:28:17,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:17,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:17,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:17,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:17,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:17,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:17,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:17,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:17,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:17,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:17,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:17,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:17,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:17,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:17,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:17,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 15 letters. Loop has 12 letters. [2020-07-29 01:28:17,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 12 letters. [2020-07-29 01:28:17,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 15 letters. Loop has 12 letters. [2020-07-29 01:28:17,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:17,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:17,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:17,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:17,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:17,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:17,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 15 letters. Loop has 16 letters. [2020-07-29 01:28:17,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 16 letters. [2020-07-29 01:28:17,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 15 letters. Loop has 16 letters. [2020-07-29 01:28:17,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:17,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:17,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:28:17,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 11 letters. Loop has 12 letters. [2020-07-29 01:28:17,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 12 letters. [2020-07-29 01:28:17,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 11 letters. Loop has 12 letters. [2020-07-29 01:28:17,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:17,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:17,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:28:17,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 15 letters. Loop has 16 letters. [2020-07-29 01:28:17,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 16 letters. [2020-07-29 01:28:17,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 15 letters. Loop has 16 letters. [2020-07-29 01:28:17,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:17,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:17,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:17,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:28:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:17,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:17,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:28:17,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:17,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:17,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:28:17,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:17,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:17,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:17,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:17,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:17,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:17,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:17,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:17,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:17,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:17,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:17,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 317 transitions. cyclomatic complexity: 133 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 490 states and 759 transitions. cyclomatic complexity: 317 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:17,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,769 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:28:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-29 01:28:17,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:28:17,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:28:17,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 16 letters. [2020-07-29 01:28:17,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:17,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 490 states and 759 transitions. cyclomatic complexity: 317 [2020-07-29 01:28:17,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:28:17,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 490 states to 285 states and 426 transitions. [2020-07-29 01:28:17,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 01:28:17,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 01:28:17,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 426 transitions. [2020-07-29 01:28:17,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:17,798 INFO L688 BuchiCegarLoop]: Abstraction has 285 states and 426 transitions. [2020-07-29 01:28:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 426 transitions. [2020-07-29 01:28:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 193. [2020-07-29 01:28:17,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:17,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states and 426 transitions. Second operand 193 states. [2020-07-29 01:28:17,804 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states and 426 transitions. Second operand 193 states. [2020-07-29 01:28:17,804 INFO L87 Difference]: Start difference. First operand 285 states and 426 transitions. Second operand 193 states. [2020-07-29 01:28:17,804 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:17,815 INFO L93 Difference]: Finished difference Result 308 states and 450 transitions. [2020-07-29 01:28:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 450 transitions. [2020-07-29 01:28:17,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:17,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:17,816 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 285 states and 426 transitions. [2020-07-29 01:28:17,816 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 285 states and 426 transitions. [2020-07-29 01:28:17,816 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:17,829 INFO L93 Difference]: Finished difference Result 361 states and 525 transitions. [2020-07-29 01:28:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 525 transitions. [2020-07-29 01:28:17,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:17,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:17,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:17,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-07-29 01:28:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 295 transitions. [2020-07-29 01:28:17,835 INFO L711 BuchiCegarLoop]: Abstraction has 193 states and 295 transitions. [2020-07-29 01:28:17,835 INFO L591 BuchiCegarLoop]: Abstraction has 193 states and 295 transitions. [2020-07-29 01:28:17,835 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:28:17,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 295 transitions. [2020-07-29 01:28:17,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:17,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:17,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:17,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1] [2020-07-29 01:28:17,837 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:17,838 INFO L794 eck$LassoCheckResult]: Stem: 7235#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 7236#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 7254#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 7259#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 7256#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 7257#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 7252#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 7253#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 7307#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 7305#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 7300#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 7302#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 7315#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 7314#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 7312#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 7250#L26 [2020-07-29 01:28:17,838 INFO L796 eck$LassoCheckResult]: Loop: 7250#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 7245#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 7246#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 7249#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 7250#L26 [2020-07-29 01:28:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash -725859107, now seen corresponding path program 1 times [2020-07-29 01:28:17,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:17,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218957723] [2020-07-29 01:28:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:17,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:17,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:17,850 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:17,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1479302, now seen corresponding path program 3 times [2020-07-29 01:28:17,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:17,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151877143] [2020-07-29 01:28:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:17,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:17,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:17,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:17,857 INFO L82 PathProgramCache]: Analyzing trace with hash -517142174, now seen corresponding path program 2 times [2020-07-29 01:28:17,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:17,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940374168] [2020-07-29 01:28:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:17,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:17,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:17,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:17,902 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:17,902 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:17,902 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:17,902 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:17,902 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:17,902 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:17,902 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:17,902 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:17,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration10_Loop [2020-07-29 01:28:17,903 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:17,903 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:17,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:17,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:17,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:17,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:18,046 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:18,047 INFO L404 LassoAnalysis]: Checking for nontermination... 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:28:18,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:18,051 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:18,059 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:18,059 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_19=0} Honda state: {v_rep~unnamed0~0~false_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:18,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:18,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:18,084 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:18,085 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_19=1} Honda state: {v_rep~unnamed0~0~true_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:18,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:18,107 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:28:18,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:18,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:18,218 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:18,219 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:18,219 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:18,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:18,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:18,220 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:18,220 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:18,220 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:18,220 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:18,220 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration10_Loop [2020-07-29 01:28:18,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:18,221 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:18,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28: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:28: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:28:18,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:18,363 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:18,364 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:28:18,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:18,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:18,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:18,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:18,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:18,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:18,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:18,373 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 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:28:18,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:18,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:18,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:18,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:18,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:18,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:18,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:18,401 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 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:28:18,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:18,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:18,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:18,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:18,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:18,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:18,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:18,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:18,429 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:18,432 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:28:18,432 INFO L444 ModelExtractionUtils]: 3 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:18,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:18,434 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:18,435 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:18,435 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-07-29 01:28:18,457 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:18,459 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1;" "main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;" [2020-07-29 01:28:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:18,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {8441#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {8441#unseeded} is VALID [2020-07-29 01:28:18,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {8441#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {8441#unseeded} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {8441#unseeded} is VALID [2020-07-29 01:28:18,501 INFO L280 TraceCheckUtils]: 4: Hoare triple {8441#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {8441#unseeded} is VALID [2020-07-29 01:28:18,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {8441#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,503 INFO L280 TraceCheckUtils]: 7: Hoare triple {8441#unseeded} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {8441#unseeded} is VALID [2020-07-29 01:28:18,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {8441#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {8441#unseeded} is VALID [2020-07-29 01:28:18,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,504 INFO L280 TraceCheckUtils]: 10: Hoare triple {8441#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,504 INFO L280 TraceCheckUtils]: 11: Hoare triple {8441#unseeded} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {8441#unseeded} is VALID [2020-07-29 01:28:18,504 INFO L280 TraceCheckUtils]: 12: Hoare triple {8441#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {8441#unseeded} is VALID [2020-07-29 01:28:18,505 INFO L280 TraceCheckUtils]: 13: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,505 INFO L280 TraceCheckUtils]: 14: Hoare triple {8441#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:18,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {8444#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {8501#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:18,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {8501#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {8501#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:18,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {8501#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8508#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:28:18,568 INFO L280 TraceCheckUtils]: 3: Hoare triple {8508#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8454#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:18,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:18,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:18,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:28:18,585 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2020-07-29 01:28:18,647 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 302 states and 452 transitions. Complement of second has 7 states. [2020-07-29 01:28:18,647 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:28:18,647 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:18,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 295 transitions. cyclomatic complexity: 126 [2020-07-29 01:28:18,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:18,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:18,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:18,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:18,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:18,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:18,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 452 transitions. [2020-07-29 01:28:18,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:18,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:18,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:18,651 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 193 states and 295 transitions. cyclomatic complexity: 126 [2020-07-29 01:28:18,652 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:18,652 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:18,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:18,652 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:18,653 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 302 states and 452 transitions. cyclomatic complexity: 175 [2020-07-29 01:28:18,653 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:18,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:18,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:18,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:18,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 302 letters. Loop has 302 letters. [2020-07-29 01:28:18,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 302 letters. Loop has 302 letters. [2020-07-29 01:28:18,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 302 letters. Loop has 302 letters. [2020-07-29 01:28:18,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 193 letters. Loop has 193 letters. [2020-07-29 01:28:18,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 193 letters. Loop has 193 letters. [2020-07-29 01:28:18,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 193 letters. Loop has 193 letters. [2020-07-29 01:28:18,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:18,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:18,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:18,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:18,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:18,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:18,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 302 states and 452 transitions. cyclomatic complexity: 175 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,664 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-29 01:28:18,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,664 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:18,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {8441#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {8441#unseeded} is VALID [2020-07-29 01:28:18,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {8441#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,704 INFO L280 TraceCheckUtils]: 3: Hoare triple {8441#unseeded} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {8441#unseeded} is VALID [2020-07-29 01:28:18,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {8441#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {8441#unseeded} is VALID [2020-07-29 01:28:18,705 INFO L280 TraceCheckUtils]: 5: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,706 INFO L280 TraceCheckUtils]: 6: Hoare triple {8441#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,707 INFO L280 TraceCheckUtils]: 7: Hoare triple {8441#unseeded} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {8441#unseeded} is VALID [2020-07-29 01:28:18,707 INFO L280 TraceCheckUtils]: 8: Hoare triple {8441#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {8441#unseeded} is VALID [2020-07-29 01:28:18,708 INFO L280 TraceCheckUtils]: 9: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,708 INFO L280 TraceCheckUtils]: 10: Hoare triple {8441#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {8441#unseeded} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {8441#unseeded} is VALID [2020-07-29 01:28:18,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {8441#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {8441#unseeded} is VALID [2020-07-29 01:28:18,714 INFO L280 TraceCheckUtils]: 13: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,715 INFO L280 TraceCheckUtils]: 14: Hoare triple {8441#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:18,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {8444#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {8870#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:18,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {8870#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {8870#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:18,790 INFO L280 TraceCheckUtils]: 2: Hoare triple {8870#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8877#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:28:18,791 INFO L280 TraceCheckUtils]: 3: Hoare triple {8877#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8454#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:18,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:18,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:18,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,805 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:28:18,805 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2020-07-29 01:28:18,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 313 states and 443 transitions. Complement of second has 7 states. [2020-07-29 01:28:18,874 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:28:18,874 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:18,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 295 transitions. cyclomatic complexity: 126 [2020-07-29 01:28:18,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:18,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:18,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:18,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:18,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:18,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:18,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 443 transitions. [2020-07-29 01:28:18,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:18,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:18,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:18,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 193 states and 295 transitions. cyclomatic complexity: 126 [2020-07-29 01:28:18,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:18,881 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:18,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:18,882 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:18,882 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 313 states and 443 transitions. cyclomatic complexity: 155 [2020-07-29 01:28:18,883 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:18,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:18,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:18,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:18,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 313 letters. Loop has 313 letters. [2020-07-29 01:28:18,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 313 letters. Loop has 313 letters. [2020-07-29 01:28:18,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 313 letters. Loop has 313 letters. [2020-07-29 01:28:18,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 193 letters. Loop has 193 letters. [2020-07-29 01:28:18,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 193 letters. Loop has 193 letters. [2020-07-29 01:28:18,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 193 letters. Loop has 193 letters. [2020-07-29 01:28:18,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:18,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:18,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:18,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:18,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:18,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:18,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:18,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:18,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 313 states and 443 transitions. cyclomatic complexity: 155 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:18,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,905 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:28:18,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:18,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:18,907 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:18,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {8441#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {8441#unseeded} is VALID [2020-07-29 01:28:18,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {8441#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,950 INFO L280 TraceCheckUtils]: 3: Hoare triple {8441#unseeded} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {8441#unseeded} is VALID [2020-07-29 01:28:18,951 INFO L280 TraceCheckUtils]: 4: Hoare triple {8441#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {8441#unseeded} is VALID [2020-07-29 01:28:18,951 INFO L280 TraceCheckUtils]: 5: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,952 INFO L280 TraceCheckUtils]: 6: Hoare triple {8441#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,953 INFO L280 TraceCheckUtils]: 7: Hoare triple {8441#unseeded} assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; {8441#unseeded} is VALID [2020-07-29 01:28:18,954 INFO L280 TraceCheckUtils]: 8: Hoare triple {8441#unseeded} main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {8441#unseeded} is VALID [2020-07-29 01:28:18,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,956 INFO L280 TraceCheckUtils]: 10: Hoare triple {8441#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {8441#unseeded} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {8441#unseeded} is VALID [2020-07-29 01:28:18,957 INFO L280 TraceCheckUtils]: 12: Hoare triple {8441#unseeded} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {8441#unseeded} is VALID [2020-07-29 01:28:18,958 INFO L280 TraceCheckUtils]: 13: Hoare triple {8441#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {8441#unseeded} is VALID [2020-07-29 01:28:18,958 INFO L280 TraceCheckUtils]: 14: Hoare triple {8441#unseeded} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8441#unseeded} is VALID [2020-07-29 01:28:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:18,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:19,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {8444#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; {9250#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:19,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {9250#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {9250#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:19,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {9250#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {9257#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:28:19,020 INFO L280 TraceCheckUtils]: 3: Hoare triple {9257#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (< 0 ULTIMATE.start_main_~y~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {8454#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:19,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:19,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:19,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:19,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,030 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:28:19,030 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2020-07-29 01:28:19,101 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 423 states and 703 transitions. Complement of second has 8 states. [2020-07-29 01:28:19,102 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:28:19,102 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:19,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 295 transitions. cyclomatic complexity: 126 [2020-07-29 01:28:19,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:19,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:19,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:19,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:19,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:19,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:19,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 423 states and 703 transitions. [2020-07-29 01:28:19,107 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:19,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:19,108 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 193 states and 295 transitions. cyclomatic complexity: 126 [2020-07-29 01:28:19,108 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:19,108 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:19,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:19,109 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:19,109 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 423 states and 703 transitions. cyclomatic complexity: 314 [2020-07-29 01:28:19,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 423 states and 703 transitions. cyclomatic complexity: 314 [2020-07-29 01:28:19,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:19,110 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:19,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:19,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:19,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:19,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 423 letters. Loop has 423 letters. [2020-07-29 01:28:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 423 letters. Loop has 423 letters. [2020-07-29 01:28:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 423 letters. Loop has 423 letters. [2020-07-29 01:28:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 193 letters. Loop has 193 letters. [2020-07-29 01:28:19,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 193 letters. Loop has 193 letters. [2020-07-29 01:28:19,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 193 letters. Loop has 193 letters. [2020-07-29 01:28:19,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:19,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:19,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:19,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:19,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:19,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:28:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:19,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:19,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:19,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:28:19,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:19,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:19,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:28:19,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 193 states and 295 transitions. cyclomatic complexity: 126 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:19,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:19,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 423 states and 703 transitions. cyclomatic complexity: 314 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:19,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,122 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-29 01:28:19,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:28:19,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:28:19,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:28:19,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:19,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 703 transitions. cyclomatic complexity: 314 [2020-07-29 01:28:19,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:19,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 0 states and 0 transitions. [2020-07-29 01:28:19,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:19,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:19,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:19,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:19,141 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:19,142 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:19,142 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:19,142 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:28:19,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:19,142 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:19,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:19,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:19 BoogieIcfgContainer [2020-07-29 01:28:19,151 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:19,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:19,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:19,152 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:19,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:05" (3/4) ... [2020-07-29 01:28:19,158 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:19,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:19,160 INFO L168 Benchmark]: Toolchain (without parser) took 14880.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.1 MB). Free memory was 956.2 MB in the beginning and 1.0 GB in the end (delta: -70.5 MB). Peak memory consumption was 298.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:19,162 INFO L168 Benchmark]: CDTParser took 0.26 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:28:19,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.40 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:19,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:19,163 INFO L168 Benchmark]: Boogie Preprocessor took 29.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:19,163 INFO L168 Benchmark]: RCFGBuilder took 299.68 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.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:19,164 INFO L168 Benchmark]: BuchiAutomizer took 14091.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.5 MB). Peak memory consumption was 313.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:19,165 INFO L168 Benchmark]: Witness Printer took 7.10 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:19,168 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.26 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 343.40 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.68 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.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14091.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.5 MB). Peak memory consumption was 313.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.10 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (0 trivial, 7 deterministic, 3 nondeterministic). One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 7 locations. One deterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.0s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 8.5s. Construction of modules took 0.5s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 316 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 205 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 190 SDtfs, 277 SDslu, 117 SDs, 0 SdLazy, 323 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT10 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax149 hnf97 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp100 dnf100 smp100 tf107 neg100 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...