./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.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 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:27:04,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:27:04,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:27:04,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:27:04,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:27:04,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:27:04,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:27:04,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:27:04,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:27:04,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:27:04,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:27:04,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:27:04,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:27:04,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:27:04,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:27:04,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:27:04,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:27:04,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:27:04,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:27:04,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:27:04,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:27:04,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:27:04,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:27:04,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:27:04,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:27:04,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:27:04,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:27:04,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:27:04,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:27:04,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:27:04,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:27:04,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:27:04,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:27:04,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:27:04,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:27:04,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:27:04,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:27:04,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:27:04,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:27:04,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:27:04,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:27:04,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:27:04,189 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:27:04,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:27:04,190 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:27:04,190 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:27:04,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:27:04,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:27:04,191 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:27:04,191 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:27:04,191 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:27:04,191 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:27:04,192 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:27:04,192 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:27:04,192 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:27:04,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:27:04,193 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:27:04,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:27:04,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:27:04,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:27:04,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:27:04,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:27:04,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:27:04,194 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:27:04,194 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:27:04,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:27:04,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:27:04,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:27:04,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:27:04,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:27:04,195 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:27:04,195 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 [2022-02-21 03:27:04,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:27:04,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:27:04,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:27:04,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:27:04,421 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:27:04,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2022-02-21 03:27:04,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1dee6450/77aeef1442b2488d8adb4a299e081902/FLAG6f3435f0e [2022-02-21 03:27:04,828 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:27:04,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2022-02-21 03:27:04,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1dee6450/77aeef1442b2488d8adb4a299e081902/FLAG6f3435f0e [2022-02-21 03:27:04,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1dee6450/77aeef1442b2488d8adb4a299e081902 [2022-02-21 03:27:04,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:27:04,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:27:04,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:27:04,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:27:04,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:27:04,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:27:04" (1/1) ... [2022-02-21 03:27:04,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f14a0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:04, skipping insertion in model container [2022-02-21 03:27:04,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:27:04" (1/1) ... [2022-02-21 03:27:04,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:27:04,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:27:05,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:27:05,019 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:27:05,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:27:05,045 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:27:05,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05 WrapperNode [2022-02-21 03:27:05,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:27:05,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:27:05,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:27:05,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:27:05,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,072 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 03:27:05,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:27:05,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:27:05,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:27:05,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:27:05,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:27:05,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:27:05,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:27:05,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:27:05,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (1/1) ... [2022-02-21 03:27:05,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:05,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:05,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:05,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:27:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:27:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:27:05,191 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:27:05,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:27:05,304 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:27:05,309 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:27:05,309 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:27:05,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:27:05 BoogieIcfgContainer [2022-02-21 03:27:05,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:27:05,312 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:27:05,313 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:27:05,315 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:27:05,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:27:05,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:27:04" (1/3) ... [2022-02-21 03:27:05,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21b42a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:27:05, skipping insertion in model container [2022-02-21 03:27:05,317 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:27:05,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:05" (2/3) ... [2022-02-21 03:27:05,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21b42a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:27:05, skipping insertion in model container [2022-02-21 03:27:05,317 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:27:05,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:27:05" (3/3) ... [2022-02-21 03:27:05,319 INFO L388 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2022-02-21 03:27:05,358 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:27:05,358 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:27:05,358 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:27:05,358 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:27:05,358 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:27:05,358 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:27:05,359 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:27:05,359 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:27:05,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:05,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:27:05,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:05,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:05,395 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:27:05,395 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:05,395 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:27:05,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:05,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:27:05,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:05,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:05,399 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:27:05,399 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:05,403 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 6#L18-1true [2022-02-21 03:27:05,403 INFO L793 eck$LassoCheckResult]: Loop: 6#L18-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11#L12true assume !(main_~i~0#1 >= 10); 3#L12-2true assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 8#L15-1true assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6#L18-1true [2022-02-21 03:27:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:27:05,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:05,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353406477] [2022-02-21 03:27:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:05,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:05,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:05,484 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:05,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:05,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2022-02-21 03:27:05,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:05,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625388868] [2022-02-21 03:27:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:05,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:05,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:05,527 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2022-02-21 03:27:05,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:05,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001492544] [2022-02-21 03:27:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:05,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:05,552 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:05,572 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:05,675 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:05,676 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:05,676 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:05,676 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:05,676 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:05,676 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:05,676 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:05,676 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:05,677 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2022-02-21 03:27:05,677 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:05,677 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:05,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:05,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:05,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:05,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:05,811 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:05,811 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:05,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:05,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:05,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:05,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:27:05,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:05,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:05,894 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:05,894 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: [] [2022-02-21 03:27:05,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:05,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:05,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:05,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:05,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:27:05,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:05,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:05,987 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:05,988 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: [] [2022-02-21 03:27:06,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:27:06,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:06,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:06,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:06,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:27:06,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:06,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:06,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:06,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:06,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:06,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:06,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:27:06,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:06,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:06,119 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:06,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:27:06,139 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:06,139 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:06,139 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:06,140 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:06,140 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:06,140 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:06,140 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:06,140 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:06,140 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2022-02-21 03:27:06,140 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:06,140 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:06,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:06,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:06,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:06,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:06,208 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:06,211 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:06,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:06,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:06,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:06,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:27:06,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:06,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:06,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:06,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:06,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:06,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:06,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:06,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:06,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:06,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:06,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:06,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:06,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:06,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:27:06,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:06,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:06,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:06,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:06,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:06,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:27:06,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:27:06,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:06,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:06,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:06,390 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:06,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:06,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:27:06,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:06,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:06,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:06,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:06,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:27:06,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:27:06,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:06,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:06,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:06,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:06,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:06,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:27:06,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:06,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:06,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:06,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:06,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:06,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:06,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:06,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:06,484 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:06,487 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:06,487 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:27:06,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:06,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:06,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:06,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:27:06,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:06,537 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:06,537 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:06,538 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2022-02-21 03:27:06,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:06,566 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:06,569 INFO L390 LassoCheck]: Loop: "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10);" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" [2022-02-21 03:27:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:06,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:06,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:06,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#unseeded} assume { :begin_inline_ULTIMATE.init } true; {20#unseeded} is VALID [2022-02-21 03:27:06,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {20#unseeded} is VALID [2022-02-21 03:27:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:06,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:06,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:06,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1))} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {23#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1))} is VALID [2022-02-21 03:27:06,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1))} assume !(main_~i~0#1 >= 10); {23#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1))} is VALID [2022-02-21 03:27:06,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1))} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {47#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1)))} is VALID [2022-02-21 03:27:06,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1)))} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {33#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1))))} is VALID [2022-02-21 03:27:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:06,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:06,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:06,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,698 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 [2022-02-21 03:27:06,699 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,768 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 54 transitions. Complement of second has 8 states. [2022-02-21 03:27:06,769 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 [2022-02-21 03:27:06,769 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:06,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:27:06,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:06,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:06,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:27:06,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:06,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:06,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 54 transitions. [2022-02-21 03:27:06,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:27:06,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:06,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:06,775 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:27:06,776 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:27:06,776 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:27:06,778 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:06,778 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 54 transitions. cyclomatic complexity: 21 [2022-02-21 03:27:06,779 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:27:06,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:06,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:06,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:06,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:06,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:06,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:06,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:06,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:06,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:06,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:27:06,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:27:06,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:27:06,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:27:06,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:27:06,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:27:06,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:27:06,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:27:06,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:27:06,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:06,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:06,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:06,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:06,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:06,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:06,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:06,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:06,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:06,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:06,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:06,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:06,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:27:06,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:27:06,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:27:06,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:06,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:06,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:06,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:06,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:06,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:06,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:06,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:06,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:06,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:06,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:06,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:06,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:06,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:06,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:06,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:06,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:06,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:06,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:06,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:06,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:06,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:06,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:06,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:06,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:06,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:06,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 54 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:06,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,811 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-21 03:27:06,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2022-02-21 03:27:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:06,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 54 transitions. cyclomatic complexity: 21 [2022-02-21 03:27:06,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:27:06,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 19 states and 30 transitions. [2022-02-21 03:27:06,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:27:06,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:27:06,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2022-02-21 03:27:06,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:06,823 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2022-02-21 03:27:06,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2022-02-21 03:27:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-21 03:27:06,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:06,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 30 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,882 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 30 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,883 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,885 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:06,887 INFO L93 Difference]: Finished difference Result 19 states and 30 transitions. [2022-02-21 03:27:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-02-21 03:27:06,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:06,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:06,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 30 transitions. [2022-02-21 03:27:06,888 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 30 transitions. [2022-02-21 03:27:06,888 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:06,889 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. [2022-02-21 03:27:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2022-02-21 03:27:06,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:06,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:06,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:06,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2022-02-21 03:27:06,891 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2022-02-21 03:27:06,891 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2022-02-21 03:27:06,891 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:27:06,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2022-02-21 03:27:06,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:27:06,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:06,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:06,892 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:27:06,892 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:06,892 INFO L791 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 110#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 112#L12 [2022-02-21 03:27:06,892 INFO L793 eck$LassoCheckResult]: Loop: 112#L12 assume !(main_~i~0#1 >= 10); 98#L12-2 assume !(main_~i~0#1 <= 0); 100#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 115#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 112#L12 [2022-02-21 03:27:06,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:27:06,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:06,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916228710] [2022-02-21 03:27:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:06,906 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:06,914 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2022-02-21 03:27:06,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:06,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985311350] [2022-02-21 03:27:06,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:06,964 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:06,975 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2022-02-21 03:27:06,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:06,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590629433] [2022-02-21 03:27:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:07,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {199#true} assume { :begin_inline_ULTIMATE.init } true; {199#true} is VALID [2022-02-21 03:27:07,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {201#(<= |ULTIMATE.start_main_~up~0#1| 0)} is VALID [2022-02-21 03:27:07,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#(<= |ULTIMATE.start_main_~up~0#1| 0)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {201#(<= |ULTIMATE.start_main_~up~0#1| 0)} is VALID [2022-02-21 03:27:07,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {201#(<= |ULTIMATE.start_main_~up~0#1| 0)} assume !(main_~i~0#1 >= 10); {201#(<= |ULTIMATE.start_main_~up~0#1| 0)} is VALID [2022-02-21 03:27:07,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#(<= |ULTIMATE.start_main_~up~0#1| 0)} assume !(main_~i~0#1 <= 0); {201#(<= |ULTIMATE.start_main_~up~0#1| 0)} is VALID [2022-02-21 03:27:07,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#(<= |ULTIMATE.start_main_~up~0#1| 0)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {200#false} is VALID [2022-02-21 03:27:07,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {200#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {200#false} is VALID [2022-02-21 03:27:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:07,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:07,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590629433] [2022-02-21 03:27:07,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590629433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:27:07,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:27:07,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:27:07,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534802448] [2022-02-21 03:27:07,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:27:07,082 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:07,082 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:07,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:07,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:07,082 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:07,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:07,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:07,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2022-02-21 03:27:07,082 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:07,082 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:07,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,151 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:07,151 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:07,153 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:07,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:27:07,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:07,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:07,176 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:07,177 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: [] [2022-02-21 03:27:07,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:07,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:07,198 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:07,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:27:07,200 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:07,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:07,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:27:07,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:07,239 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:07,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:27:07,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:07,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:07,271 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:07,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:07,277 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:07,277 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:07,277 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:07,277 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:07,277 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:07,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:07,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:07,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2022-02-21 03:27:07,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:07,277 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:07,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,344 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:07,344 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:07,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:07,368 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:07,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:27:07,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:07,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:07,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:07,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:07,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:07,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:27:07,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:27:07,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:07,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:07,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:07,414 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:07,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:27:07,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:07,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:07,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:07,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:07,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:07,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:07,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:07,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:07,437 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:07,440 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:07,440 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:27:07,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:07,441 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:07,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:27:07,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:07,445 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:07,445 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:07,445 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2022-02-21 03:27:07,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:07,467 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:07,469 INFO L390 LassoCheck]: Loop: "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10);" [2022-02-21 03:27:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:07,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:07,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:07,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#unseeded} assume { :begin_inline_ULTIMATE.init } true; {202#unseeded} is VALID [2022-02-21 03:27:07,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {202#unseeded} is VALID [2022-02-21 03:27:07,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {202#unseeded} is VALID [2022-02-21 03:27:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:07,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:07,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:07,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19))} assume !(main_~i~0#1 >= 10); {226#(and (not (<= 10 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19)))} is VALID [2022-02-21 03:27:07,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#(and (not (<= 10 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19)))} assume !(main_~i~0#1 <= 0); {226#(and (not (<= 10 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19)))} is VALID [2022-02-21 03:27:07,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#(and (not (<= 10 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19)))} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {233#(and (< (div (+ oldRank0 (- 19)) (- 2)) 10) (<= (+ (div (+ oldRank0 (- 19)) (- 2)) 1) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:27:07,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {233#(and (< (div (+ oldRank0 (- 19)) (- 2)) 10) (<= (+ (div (+ oldRank0 (- 19)) (- 2)) 1) |ULTIMATE.start_main_~i~0#1|))} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {215#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19))))} is VALID [2022-02-21 03:27:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:07,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:07,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:07,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,575 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 [2022-02-21 03:27:07,575 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,614 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 73 transitions. Complement of second has 7 states. [2022-02-21 03:27:07,614 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 [2022-02-21 03:27:07,614 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:07,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:27:07,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:07,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:07,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:07,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:07,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:07,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 73 transitions. [2022-02-21 03:27:07,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:27:07,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:07,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:07,616 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:27:07,617 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:27:07,617 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:07,617 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:07,617 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 73 transitions. cyclomatic complexity: 34 [2022-02-21 03:27:07,618 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:27:07,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:07,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:07,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:07,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:07,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:07,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:07,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:07,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:07,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:07,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:27:07,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:07,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:07,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:07,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:07,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:07,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:07,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:07,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:07,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:07,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:07,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:07,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:07,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:07,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:07,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 28 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 73 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,659 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-21 03:27:07,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:27:07,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:07,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:27:07,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:07,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 73 transitions. cyclomatic complexity: 34 [2022-02-21 03:27:07,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:27:07,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:07,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 36 states and 59 transitions. [2022-02-21 03:27:07,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:27:07,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:27:07,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 59 transitions. [2022-02-21 03:27:07,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:07,666 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 59 transitions. [2022-02-21 03:27:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 59 transitions. [2022-02-21 03:27:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-02-21 03:27:07,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:07,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 59 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,668 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 59 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,668 INFO L87 Difference]: Start difference. First operand 36 states and 59 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,668 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:07,670 INFO L93 Difference]: Finished difference Result 38 states and 63 transitions. [2022-02-21 03:27:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2022-02-21 03:27:07,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:07,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:07,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states and 59 transitions. [2022-02-21 03:27:07,671 INFO L87 Difference]: Start difference. First operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states and 59 transitions. [2022-02-21 03:27:07,671 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:07,673 INFO L93 Difference]: Finished difference Result 44 states and 73 transitions. [2022-02-21 03:27:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 73 transitions. [2022-02-21 03:27:07,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:07,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:07,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:07,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2022-02-21 03:27:07,675 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 46 transitions. [2022-02-21 03:27:07,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:27:07,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:27:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:27:07,677 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:27:07,690 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2022-02-21 03:27:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:27:07,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:07,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 56 transitions. [2022-02-21 03:27:07,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:27:07,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 49 transitions. [2022-02-21 03:27:07,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 03:27:07,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 03:27:07,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2022-02-21 03:27:07,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:07,699 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-02-21 03:27:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2022-02-21 03:27:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-02-21 03:27:07,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:07,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 49 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,701 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 49 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,701 INFO L87 Difference]: Start difference. First operand 32 states and 49 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,701 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:07,703 INFO L93 Difference]: Finished difference Result 35 states and 54 transitions. [2022-02-21 03:27:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 54 transitions. [2022-02-21 03:27:07,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:07,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:07,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states and 49 transitions. [2022-02-21 03:27:07,704 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states and 49 transitions. [2022-02-21 03:27:07,704 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:07,706 INFO L93 Difference]: Finished difference Result 36 states and 55 transitions. [2022-02-21 03:27:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2022-02-21 03:27:07,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:07,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:07,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:07,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-02-21 03:27:07,707 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2022-02-21 03:27:07,707 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2022-02-21 03:27:07,707 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:27:07,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2022-02-21 03:27:07,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:27:07,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:07,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:07,708 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:27:07,708 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:07,708 INFO L791 eck$LassoCheckResult]: Stem: 493#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 494#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 503#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 499#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 489#L12-2 assume !(main_~i~0#1 <= 0); 490#L15-1 [2022-02-21 03:27:07,708 INFO L793 eck$LassoCheckResult]: Loop: 490#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 500#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 508#L12 assume !(main_~i~0#1 >= 10); 506#L12-2 assume !(main_~i~0#1 <= 0); 490#L15-1 [2022-02-21 03:27:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2022-02-21 03:27:07,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:07,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088677557] [2022-02-21 03:27:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:07,713 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:07,715 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:07,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2022-02-21 03:27:07,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:07,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184680227] [2022-02-21 03:27:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:07,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:07,752 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2022-02-21 03:27:07,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:07,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791388245] [2022-02-21 03:27:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:07,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:07,763 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:07,803 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:07,803 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:07,803 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:07,803 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:07,803 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:07,803 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,803 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:07,803 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:07,803 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2022-02-21 03:27:07,803 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:07,803 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:07,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:07,854 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:07,854 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:07,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:07,864 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:07,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:27:07,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:07,867 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:07,888 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:07,888 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: [] [2022-02-21 03:27:07,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:07,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:07,920 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:07,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:27:07,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:07,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:07,938 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:07,938 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:27:07,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:07,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:07,972 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:07,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:27:07,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:07,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:08,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:08,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:08,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:08,036 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:08,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:08,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:08,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:27:08,124 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:08,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:08,129 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:08,129 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:08,129 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:08,130 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:08,130 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:08,130 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:08,130 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:08,130 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:08,130 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2022-02-21 03:27:08,130 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:08,130 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:08,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:08,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:08,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:08,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:08,187 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:08,188 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:08,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:08,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:08,189 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:08,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:27:08,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:08,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:08,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:08,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:08,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:08,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:08,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:08,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:08,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:08,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:08,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:08,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:08,228 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:08,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:27:08,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:08,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:08,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:08,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:08,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:08,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:08,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:08,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:08,268 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:08,270 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:27:08,270 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:27:08,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:08,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:08,276 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:08,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:27:08,278 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:08,278 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:08,278 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:08,278 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:27:08,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:27:08,298 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:08,301 INFO L390 LassoCheck]: Loop: "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10);" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2022-02-21 03:27:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:08,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#unseeded} assume { :begin_inline_ULTIMATE.init } true; {648#unseeded} is VALID [2022-02-21 03:27:08,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {648#unseeded} is VALID [2022-02-21 03:27:08,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {648#unseeded} is VALID [2022-02-21 03:27:08,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {648#unseeded} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {648#unseeded} is VALID [2022-02-21 03:27:08,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {648#unseeded} assume !(main_~i~0#1 <= 0); {648#unseeded} is VALID [2022-02-21 03:27:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:08,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {651#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {678#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:08,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {678#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:08,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {678#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume !(main_~i~0#1 >= 10); {678#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:08,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {678#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume !(main_~i~0#1 <= 0); {661#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:27:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:08,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:08,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:08,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,383 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 [2022-02-21 03:27:08,383 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,434 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 58 states and 90 transitions. Complement of second has 7 states. [2022-02-21 03:27:08,434 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 [2022-02-21 03:27:08,434 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:08,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. cyclomatic complexity: 17 [2022-02-21 03:27:08,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:08,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:08,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:08,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:08,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:08,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 90 transitions. [2022-02-21 03:27:08,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:27:08,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:08,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:08,437 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 40 transitions. cyclomatic complexity: 17 [2022-02-21 03:27:08,438 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:27:08,438 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:08,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:08,439 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 90 transitions. cyclomatic complexity: 38 [2022-02-21 03:27:08,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:27:08,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:08,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:08,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:08,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:08,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:08,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:08,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:08,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:08,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:08,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 58 letters. Loop has 58 letters. [2022-02-21 03:27:08,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 58 letters. [2022-02-21 03:27:08,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 58 letters. Loop has 58 letters. [2022-02-21 03:27:08,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:27:08,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:27:08,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:27:08,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:08,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:08,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:08,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:08,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:08,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:08,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:08,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:08,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:08,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:08,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:27:08,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:08,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:08,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:27:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:08,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 90 transitions. cyclomatic complexity: 38 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:08,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,487 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:27:08,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:27:08,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:08,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:27:08,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:08,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 90 transitions. cyclomatic complexity: 38 [2022-02-21 03:27:08,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:27:08,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 85 transitions. [2022-02-21 03:27:08,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-02-21 03:27:08,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-02-21 03:27:08,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2022-02-21 03:27:08,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:08,500 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2022-02-21 03:27:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2022-02-21 03:27:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-02-21 03:27:08,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:08,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states and 85 transitions. Second operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,510 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states and 85 transitions. Second operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,510 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,510 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:08,519 INFO L93 Difference]: Finished difference Result 63 states and 98 transitions. [2022-02-21 03:27:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 98 transitions. [2022-02-21 03:27:08,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:08,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:08,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states and 85 transitions. [2022-02-21 03:27:08,521 INFO L87 Difference]: Start difference. First operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states and 85 transitions. [2022-02-21 03:27:08,521 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:08,525 INFO L93 Difference]: Finished difference Result 63 states and 98 transitions. [2022-02-21 03:27:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 98 transitions. [2022-02-21 03:27:08,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:08,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:08,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:08,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2022-02-21 03:27:08,531 INFO L704 BuchiCegarLoop]: Abstraction has 49 states and 79 transitions. [2022-02-21 03:27:08,531 INFO L587 BuchiCegarLoop]: Abstraction has 49 states and 79 transitions. [2022-02-21 03:27:08,531 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:27:08,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 79 transitions. [2022-02-21 03:27:08,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:27:08,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:08,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:08,534 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:27:08,535 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:08,535 INFO L791 eck$LassoCheckResult]: Stem: 760#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 761#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 770#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 782#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 775#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 776#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 779#L18-1 [2022-02-21 03:27:08,535 INFO L793 eck$LassoCheckResult]: Loop: 779#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 777#L12 assume !(main_~i~0#1 >= 10); 778#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 788#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 779#L18-1 [2022-02-21 03:27:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2022-02-21 03:27:08,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:08,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197904689] [2022-02-21 03:27:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {1025#true} assume { :begin_inline_ULTIMATE.init } true; {1025#true} is VALID [2022-02-21 03:27:08,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {1025#true} is VALID [2022-02-21 03:27:08,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1025#true} is VALID [2022-02-21 03:27:08,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {1025#true} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {1027#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {1027#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {1026#false} is VALID [2022-02-21 03:27:08,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {1026#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {1026#false} is VALID [2022-02-21 03:27:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:08,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:08,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197904689] [2022-02-21 03:27:08,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197904689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:27:08,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:27:08,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:27:08,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487346938] [2022-02-21 03:27:08,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:27:08,552 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:27:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2022-02-21 03:27:08,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:08,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849896033] [2022-02-21 03:27:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:08,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {1028#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1028#true} is VALID [2022-02-21 03:27:08,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {1028#true} assume !(main_~i~0#1 >= 10); {1028#true} is VALID [2022-02-21 03:27:08,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {1028#true} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {1030#(<= 1 |ULTIMATE.start_main_~up~0#1|)} is VALID [2022-02-21 03:27:08,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {1030#(<= 1 |ULTIMATE.start_main_~up~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {1029#false} is VALID [2022-02-21 03:27:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:08,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:08,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849896033] [2022-02-21 03:27:08,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849896033] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:27:08,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:27:08,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:27:08,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945678259] [2022-02-21 03:27:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:27:08,567 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:27:08,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:27:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:27:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:27:08,568 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. cyclomatic complexity: 36 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:27:08,582 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2022-02-21 03:27:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:27:08,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:08,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 69 transitions. [2022-02-21 03:27:08,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:27:08,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 60 transitions. [2022-02-21 03:27:08,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 03:27:08,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 03:27:08,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 60 transitions. [2022-02-21 03:27:08,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:08,588 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 60 transitions. [2022-02-21 03:27:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 60 transitions. [2022-02-21 03:27:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-02-21 03:27:08,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:08,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 60 transitions. Second operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,590 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 60 transitions. Second operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,590 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,590 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:08,592 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2022-02-21 03:27:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2022-02-21 03:27:08,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:08,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:08,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states and 60 transitions. [2022-02-21 03:27:08,592 INFO L87 Difference]: Start difference. First operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states and 60 transitions. [2022-02-21 03:27:08,592 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:08,594 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2022-02-21 03:27:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2022-02-21 03:27:08,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:08,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:08,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:08,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2022-02-21 03:27:08,595 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2022-02-21 03:27:08,595 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2022-02-21 03:27:08,595 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:27:08,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2022-02-21 03:27:08,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:27:08,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:08,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:08,596 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:27:08,597 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:08,597 INFO L791 eck$LassoCheckResult]: Stem: 1082#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1083#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1091#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1098#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1096#L12-2 assume !(main_~i~0#1 <= 0); 1088#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1089#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1108#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1078#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1079#L15-1 [2022-02-21 03:27:08,597 INFO L793 eck$LassoCheckResult]: Loop: 1079#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1094#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1107#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1105#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1079#L15-1 [2022-02-21 03:27:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash 588716517, now seen corresponding path program 1 times [2022-02-21 03:27:08,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:08,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310009076] [2022-02-21 03:27:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:08,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {1282#true} assume { :begin_inline_ULTIMATE.init } true; {1282#true} is VALID [2022-02-21 03:27:08,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {1282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {1282#true} is VALID [2022-02-21 03:27:08,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {1282#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1284#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:27:08,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {1284#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {1284#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:27:08,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {1284#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 <= 0); {1284#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:27:08,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {1284#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {1285#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:08,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {1285#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1285#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:08,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {1285#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {1283#false} is VALID [2022-02-21 03:27:08,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {1283#false} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {1283#false} is VALID [2022-02-21 03:27:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:08,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:08,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310009076] [2022-02-21 03:27:08,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310009076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:27:08,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:27:08,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:27:08,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580162895] [2022-02-21 03:27:08,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:27:08,627 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:27:08,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1709112, now seen corresponding path program 1 times [2022-02-21 03:27:08,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:08,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019713983] [2022-02-21 03:27:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:08,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {1286#true} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {1286#true} is VALID [2022-02-21 03:27:08,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {1286#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1286#true} is VALID [2022-02-21 03:27:08,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {1286#true} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {1288#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {1288#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {1287#false} is VALID [2022-02-21 03:27:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:08,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:08,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019713983] [2022-02-21 03:27:08,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019713983] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:27:08,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:27:08,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:27:08,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283653884] [2022-02-21 03:27:08,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:27:08,648 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:27:08,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:27:08,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:27:08,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:27:08,649 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 24 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:27:08,663 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2022-02-21 03:27:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:27:08,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:08,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2022-02-21 03:27:08,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 03:27:08,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 60 transitions. [2022-02-21 03:27:08,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-02-21 03:27:08,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-02-21 03:27:08,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2022-02-21 03:27:08,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:08,668 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2022-02-21 03:27:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2022-02-21 03:27:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-02-21 03:27:08,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:08,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 60 transitions. Second operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,670 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 60 transitions. Second operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,670 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,670 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:08,671 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-02-21 03:27:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-02-21 03:27:08,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:08,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:08,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states and 60 transitions. [2022-02-21 03:27:08,672 INFO L87 Difference]: Start difference. First operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states and 60 transitions. [2022-02-21 03:27:08,672 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:08,673 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-02-21 03:27:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-02-21 03:27:08,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:08,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:08,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:08,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-02-21 03:27:08,674 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-02-21 03:27:08,674 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-02-21 03:27:08,674 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:27:08,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2022-02-21 03:27:08,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:27:08,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:08,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:08,675 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:27:08,675 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:08,675 INFO L791 eck$LassoCheckResult]: Stem: 1341#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1343#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1344#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1337#L12-2 assume !(main_~i~0#1 <= 0); 1338#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1348#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1363#L12 assume !(main_~i~0#1 >= 10); 1358#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1354#L15-1 [2022-02-21 03:27:08,675 INFO L793 eck$LassoCheckResult]: Loop: 1354#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1355#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1360#L12 assume !(main_~i~0#1 >= 10); 1359#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1354#L15-1 [2022-02-21 03:27:08,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:08,676 INFO L85 PathProgramCache]: Analyzing trace with hash 588716579, now seen corresponding path program 1 times [2022-02-21 03:27:08,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:08,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984022442] [2022-02-21 03:27:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {1555#true} assume { :begin_inline_ULTIMATE.init } true; {1555#true} is VALID [2022-02-21 03:27:08,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {1555#true} is VALID [2022-02-21 03:27:08,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1555#true} is VALID [2022-02-21 03:27:08,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {1555#true} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {1557#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {1557#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {1557#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {1557#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {1556#false} is VALID [2022-02-21 03:27:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:08,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:08,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984022442] [2022-02-21 03:27:08,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984022442] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:27:08,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869752893] [2022-02-21 03:27:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:27:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:08,700 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:27:08,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-21 03:27:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:27:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:08,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:08,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {1555#true} assume { :begin_inline_ULTIMATE.init } true; {1555#true} is VALID [2022-02-21 03:27:08,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {1555#true} is VALID [2022-02-21 03:27:08,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1555#true} is VALID [2022-02-21 03:27:08,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {1555#true} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {1557#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {1557#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {1557#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {1557#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {1558#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {1556#false} is VALID [2022-02-21 03:27:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:08,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:27:08,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {1586#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {1556#false} is VALID [2022-02-21 03:27:08,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {1586#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !(main_~i~0#1 >= 10); {1586#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:27:08,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {1586#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1586#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:27:08,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {1596#(< 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {1586#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:27:08,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {1596#(< 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {1596#(< 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {1555#true} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {1596#(< 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:08,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1555#true} is VALID [2022-02-21 03:27:08,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {1555#true} is VALID [2022-02-21 03:27:08,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {1555#true} assume { :begin_inline_ULTIMATE.init } true; {1555#true} is VALID [2022-02-21 03:27:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:08,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869752893] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:27:08,808 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:27:08,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:27:08,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764312554] [2022-02-21 03:27:08,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:27:08,809 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:27:08,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1709174, now seen corresponding path program 2 times [2022-02-21 03:27:08,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:08,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568961313] [2022-02-21 03:27:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:08,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:08,816 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:08,845 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:08,845 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:08,845 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:08,845 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:08,845 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:08,845 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:08,845 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:08,845 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:08,845 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2022-02-21 03:27:08,845 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:08,846 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:08,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:08,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:08,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:08,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:08,899 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:08,900 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:08,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:08,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:08,901 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:08,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:27:08,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:08,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:08,925 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:08,925 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:27:08,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:08,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:08,962 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:08,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:27:08,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:08,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:08,982 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:08,983 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:27:09,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:09,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:09,001 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:09,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:27:09,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:09,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:09,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:09,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:09,032 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:09,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:27:09,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:09,034 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:09,094 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:09,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:27:09,097 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:09,097 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:09,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:09,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:09,097 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:09,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:09,097 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:09,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2022-02-21 03:27:09,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:09,098 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:09,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27: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 [2022-02-21 03:27:09,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,171 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:09,171 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:09,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:09,172 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:09,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:27:09,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:09,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:09,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:09,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:09,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:09,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:09,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:09,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:09,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:09,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:09,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:09,215 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:09,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:27:09,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:09,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:09,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:09,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:09,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:09,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:09,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:09,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:09,251 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:09,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:09,253 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:27:09,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:09,262 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:09,263 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:09,263 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:09,263 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:09,263 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:27:09,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:27:09,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:09,285 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:09,289 INFO L390 LassoCheck]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10);" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2022-02-21 03:27:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:09,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {1611#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1611#unseeded} is VALID [2022-02-21 03:27:09,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {1611#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {1611#unseeded} is VALID [2022-02-21 03:27:09,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {1611#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1611#unseeded} is VALID [2022-02-21 03:27:09,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {1611#unseeded} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {1611#unseeded} is VALID [2022-02-21 03:27:09,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {1611#unseeded} assume !(main_~i~0#1 <= 0); {1611#unseeded} is VALID [2022-02-21 03:27:09,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {1611#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {1611#unseeded} is VALID [2022-02-21 03:27:09,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {1611#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1611#unseeded} is VALID [2022-02-21 03:27:09,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {1611#unseeded} assume !(main_~i~0#1 >= 10); {1611#unseeded} is VALID [2022-02-21 03:27:09,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {1611#unseeded} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {1611#unseeded} is VALID [2022-02-21 03:27:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:09,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1614#(>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|))} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {1653#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:27:09,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1653#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {1653#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:27:09,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1653#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} assume !(main_~i~0#1 >= 10); {1653#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:27:09,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {1653#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {1624#(or unseeded (and (> oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 0)))} is VALID [2022-02-21 03:27:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:09,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:09,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:09,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,385 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 [2022-02-21 03:27:09,386 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,449 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 101 states and 136 transitions. Complement of second has 7 states. [2022-02-21 03:27:09,450 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 [2022-02-21 03:27:09,450 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:09,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. cyclomatic complexity: 20 [2022-02-21 03:27:09,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:09,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:09,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:09,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:09,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:09,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 136 transitions. [2022-02-21 03:27:09,451 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-02-21 03:27:09,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:09,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:09,452 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 54 transitions. cyclomatic complexity: 20 [2022-02-21 03:27:09,453 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:27:09,453 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:09,454 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:09,454 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 101 states and 136 transitions. cyclomatic complexity: 45 [2022-02-21 03:27:09,456 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:27:09,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:09,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:09,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:09,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:09,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:09,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:09,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:09,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:09,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:27:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:27:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:27:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:27:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:27:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:27:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:09,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:09,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:09,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:09,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:09,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:27:09,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:27:09,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:27:09,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:09,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:09,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:09,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:09,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:09,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:09,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:09,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:09,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:09,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:09,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:09,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:09,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:09,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:09,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:09,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:09,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:09,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:27:09,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:27:09,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:27:09,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:27:09,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:27:09,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:27:09,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:27:09,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:27:09,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:27:09,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:27:09,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:27:09,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:27:09,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:27:09,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:27:09,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:27:09,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:27:09,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:27:09,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:27:09,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:27:09,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:27:09,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:27:09,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:27:09,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:27:09,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:27:09,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:27:09,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:27:09,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:27:09,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:27:09,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:27:09,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:27:09,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:27:09,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:27:09,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:27:09,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:09,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:09,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:09,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:27:09,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:27:09,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:27:09,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:09,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:09,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:09,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:27:09,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:27:09,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:27:09,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:09,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:09,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:09,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:27:09,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:27:09,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:27:09,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:09,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:09,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:09,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 54 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:09,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:09,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 136 transitions. cyclomatic complexity: 45 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:09,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,478 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-02-21 03:27:09,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:27:09,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:09,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 8 letters. [2022-02-21 03:27:09,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:09,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 136 transitions. cyclomatic complexity: 45 [2022-02-21 03:27:09,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-02-21 03:27:09,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 91 states and 122 transitions. [2022-02-21 03:27:09,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 03:27:09,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-02-21 03:27:09,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2022-02-21 03:27:09,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:09,482 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-02-21 03:27:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2022-02-21 03:27:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2022-02-21 03:27:09,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:09,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states and 122 transitions. Second operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,485 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states and 122 transitions. Second operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,485 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,485 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:09,487 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2022-02-21 03:27:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2022-02-21 03:27:09,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:09,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:09,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 91 states and 122 transitions. [2022-02-21 03:27:09,488 INFO L87 Difference]: Start difference. First operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 91 states and 122 transitions. [2022-02-21 03:27:09,488 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:09,489 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2022-02-21 03:27:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2022-02-21 03:27:09,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:09,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:09,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:09,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2022-02-21 03:27:09,491 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 109 transitions. [2022-02-21 03:27:09,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:27:09,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:27:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:27:09,492 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:27:09,549 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-02-21 03:27:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:27:09,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:09,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. [2022-02-21 03:27:09,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2022-02-21 03:27:09,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 108 states and 137 transitions. [2022-02-21 03:27:09,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2022-02-21 03:27:09,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2022-02-21 03:27:09,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 137 transitions. [2022-02-21 03:27:09,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:09,565 INFO L681 BuchiCegarLoop]: Abstraction has 108 states and 137 transitions. [2022-02-21 03:27:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 137 transitions. [2022-02-21 03:27:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2022-02-21 03:27:09,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:09,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states and 137 transitions. Second operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,567 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states and 137 transitions. Second operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,567 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,568 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:09,569 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2022-02-21 03:27:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2022-02-21 03:27:09,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:09,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:09,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 108 states and 137 transitions. [2022-02-21 03:27:09,570 INFO L87 Difference]: Start difference. First operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 108 states and 137 transitions. [2022-02-21 03:27:09,570 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:09,571 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2022-02-21 03:27:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2022-02-21 03:27:09,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:09,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:09,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:09,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2022-02-21 03:27:09,573 INFO L704 BuchiCegarLoop]: Abstraction has 86 states and 111 transitions. [2022-02-21 03:27:09,573 INFO L587 BuchiCegarLoop]: Abstraction has 86 states and 111 transitions. [2022-02-21 03:27:09,573 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:27:09,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 111 transitions. [2022-02-21 03:27:09,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-02-21 03:27:09,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:09,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:09,574 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:27:09,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:09,574 INFO L791 eck$LassoCheckResult]: Stem: 2327#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 2331#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2341#L12 assume !(main_~i~0#1 >= 10); 2350#L12-2 assume !(main_~i~0#1 <= 0); 2349#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 2347#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2344#L12 assume !(main_~i~0#1 >= 10); 2343#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 2342#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 2322#L18-1 [2022-02-21 03:27:09,574 INFO L793 eck$LassoCheckResult]: Loop: 2322#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2323#L12 assume !(main_~i~0#1 >= 10); 2371#L12-2 assume !(main_~i~0#1 <= 0); 2333#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 2322#L18-1 [2022-02-21 03:27:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1449615143, now seen corresponding path program 1 times [2022-02-21 03:27:09,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:09,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898810669] [2022-02-21 03:27:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:09,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:09,585 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 2 times [2022-02-21 03:27:09,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:09,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913461043] [2022-02-21 03:27:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:09,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:09,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:09,592 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash -130036926, now seen corresponding path program 2 times [2022-02-21 03:27:09,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:09,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74863523] [2022-02-21 03:27:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:09,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:09,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:09,604 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:09,628 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:09,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:09,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:09,629 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:09,629 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:09,629 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,629 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:09,629 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:09,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2022-02-21 03:27:09,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:09,629 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:09,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,680 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:09,681 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:09,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:09,683 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:09,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:27:09,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:09,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:09,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:09,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:09,721 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:09,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:27:09,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:09,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:09,746 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:09,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:09,764 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:09,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:09,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:09,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:09,764 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:09,764 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,764 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:09,764 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:09,764 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2022-02-21 03:27:09,764 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:09,764 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:09,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:09,819 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:09,819 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:09,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:09,831 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:09,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:27:09,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:09,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:09,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:09,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:09,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:09,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:09,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:09,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:09,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:09,870 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:09,870 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:27:09,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:09,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:09,872 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:09,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:27:09,874 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:09,874 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:09,874 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:09,874 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2022-02-21 03:27:09,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:27:09,907 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:09,912 INFO L390 LassoCheck]: Loop: "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10);" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" [2022-02-21 03:27:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:09,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {2817#unseeded} assume { :begin_inline_ULTIMATE.init } true; {2817#unseeded} is VALID [2022-02-21 03:27:09,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {2817#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {2817#unseeded} is VALID [2022-02-21 03:27:09,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {2817#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {2817#unseeded} is VALID [2022-02-21 03:27:09,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {2817#unseeded} assume !(main_~i~0#1 >= 10); {2817#unseeded} is VALID [2022-02-21 03:27:09,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {2817#unseeded} assume !(main_~i~0#1 <= 0); {2817#unseeded} is VALID [2022-02-21 03:27:09,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {2817#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {2817#unseeded} is VALID [2022-02-21 03:27:09,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {2817#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {2817#unseeded} is VALID [2022-02-21 03:27:09,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {2817#unseeded} assume !(main_~i~0#1 >= 10); {2817#unseeded} is VALID [2022-02-21 03:27:09,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {2817#unseeded} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {2817#unseeded} is VALID [2022-02-21 03:27:09,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {2817#unseeded} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {2817#unseeded} is VALID [2022-02-21 03:27:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:09,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:10,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:10,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19))} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {2820#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19))} is VALID [2022-02-21 03:27:10,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19))} assume !(main_~i~0#1 >= 10); {2865#(and (not (<= 10 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19)))} is VALID [2022-02-21 03:27:10,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {2865#(and (not (<= 10 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19)))} assume !(main_~i~0#1 <= 0); {2865#(and (not (<= 10 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19)))} is VALID [2022-02-21 03:27:10,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {2865#(and (not (<= 10 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19)))} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {2830#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 19))))} is VALID [2022-02-21 03:27:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:10,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:10,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:10,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:10,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,074 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 [2022-02-21 03:27:10,074 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,114 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 115 states and 145 transitions. Complement of second has 7 states. [2022-02-21 03:27:10,114 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 [2022-02-21 03:27:10,114 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:10,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 111 transitions. cyclomatic complexity: 31 [2022-02-21 03:27:10,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:10,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:10,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:10,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:10,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:10,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 145 transitions. [2022-02-21 03:27:10,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-02-21 03:27:10,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:10,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:10,116 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 86 states and 111 transitions. cyclomatic complexity: 31 [2022-02-21 03:27:10,118 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:27:10,118 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:10,119 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:10,119 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 115 states and 145 transitions. cyclomatic complexity: 37 [2022-02-21 03:27:10,121 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:27:10,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:10,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 115 letters. Loop has 115 letters. [2022-02-21 03:27:10,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 115 letters. Loop has 115 letters. [2022-02-21 03:27:10,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 115 letters. Loop has 115 letters. [2022-02-21 03:27:10,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 86 letters. Loop has 86 letters. [2022-02-21 03:27:10,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 86 letters. [2022-02-21 03:27:10,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 86 letters. Loop has 86 letters. [2022-02-21 03:27:10,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:10,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:10,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:10,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 24 letters. Loop has 16 letters. [2022-02-21 03:27:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 16 letters. [2022-02-21 03:27:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 24 letters. Loop has 16 letters. [2022-02-21 03:27:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 23 letters. Loop has 12 letters. [2022-02-21 03:27:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 12 letters. [2022-02-21 03:27:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 23 letters. Loop has 12 letters. [2022-02-21 03:27:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 12 letters. [2022-02-21 03:27:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 12 letters. [2022-02-21 03:27:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 22 letters. Loop has 12 letters. [2022-02-21 03:27:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 12 letters. [2022-02-21 03:27:10,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 12 letters. [2022-02-21 03:27:10,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 21 letters. Loop has 12 letters. [2022-02-21 03:27:10,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:10,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:10,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:27:10,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 12 letters. [2022-02-21 03:27:10,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 12 letters. [2022-02-21 03:27:10,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 20 letters. Loop has 12 letters. [2022-02-21 03:27:10,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:27:10,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:27:10,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:27:10,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:27:10,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:27:10,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:27:10,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:27:10,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:27:10,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:27:10,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:10,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:10,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:10,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:10,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:10,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:10,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:10,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:10,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:10,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:10,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:10,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:27:10,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:27:10,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:27:10,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:27:10,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:27:10,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:27:10,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:27:10,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:27:10,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:27:10,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:27:10,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:27:10,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:27:10,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:27:10,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:27:10,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:27:10,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 12 letters. [2022-02-21 03:27:10,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 12 letters. [2022-02-21 03:27:10,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 20 letters. Loop has 12 letters. [2022-02-21 03:27:10,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 12 letters. [2022-02-21 03:27:10,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 12 letters. [2022-02-21 03:27:10,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 21 letters. Loop has 12 letters. [2022-02-21 03:27:10,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 12 letters. [2022-02-21 03:27:10,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 12 letters. [2022-02-21 03:27:10,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 22 letters. Loop has 12 letters. [2022-02-21 03:27:10,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 23 letters. Loop has 12 letters. [2022-02-21 03:27:10,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 12 letters. [2022-02-21 03:27:10,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 23 letters. Loop has 12 letters. [2022-02-21 03:27:10,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 24 letters. Loop has 16 letters. [2022-02-21 03:27:10,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 16 letters. [2022-02-21 03:27:10,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 24 letters. Loop has 16 letters. [2022-02-21 03:27:10,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:10,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:10,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:10,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:10,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:10,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:10,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 111 transitions. cyclomatic complexity: 31 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:10,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:10,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 145 transitions. cyclomatic complexity: 37 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:10,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,154 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:27:10,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:27:10,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:27:10,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 145 transitions. cyclomatic complexity: 37 [2022-02-21 03:27:10,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-02-21 03:27:10,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 97 states and 125 transitions. [2022-02-21 03:27:10,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-02-21 03:27:10,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-02-21 03:27:10,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 125 transitions. [2022-02-21 03:27:10,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:10,158 INFO L681 BuchiCegarLoop]: Abstraction has 97 states and 125 transitions. [2022-02-21 03:27:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 125 transitions. [2022-02-21 03:27:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2022-02-21 03:27:10,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:10,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states and 125 transitions. Second operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,160 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states and 125 transitions. Second operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,161 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,161 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:10,162 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2022-02-21 03:27:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2022-02-21 03:27:10,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:10,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:10,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 97 states and 125 transitions. [2022-02-21 03:27:10,163 INFO L87 Difference]: Start difference. First operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 97 states and 125 transitions. [2022-02-21 03:27:10,163 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:10,164 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2022-02-21 03:27:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2022-02-21 03:27:10,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:10,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:10,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:10,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2022-02-21 03:27:10,166 INFO L704 BuchiCegarLoop]: Abstraction has 86 states and 112 transitions. [2022-02-21 03:27:10,166 INFO L587 BuchiCegarLoop]: Abstraction has 86 states and 112 transitions. [2022-02-21 03:27:10,166 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:27:10,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 112 transitions. [2022-02-21 03:27:10,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-02-21 03:27:10,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:10,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:10,167 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:27:10,167 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:10,167 INFO L791 eck$LassoCheckResult]: Stem: 3001#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3002#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3012#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3068#L12 assume !(main_~i~0#1 >= 10); 3066#L12-2 assume !(main_~i~0#1 <= 0); 3040#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3038#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3033#L12 assume !(main_~i~0#1 >= 10); 3017#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 3013#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3003#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3005#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 2997#L12-2 [2022-02-21 03:27:10,167 INFO L793 eck$LassoCheckResult]: Loop: 2997#L12-2 assume !(main_~i~0#1 <= 0); 2998#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3016#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3063#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 2997#L12-2 [2022-02-21 03:27:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1510748164, now seen corresponding path program 1 times [2022-02-21 03:27:10,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:10,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246564347] [2022-02-21 03:27:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:10,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:10,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {3473#true} assume { :begin_inline_ULTIMATE.init } true; {3473#true} is VALID [2022-02-21 03:27:10,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {3473#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {3473#true} is VALID [2022-02-21 03:27:10,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {3473#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {3473#true} is VALID [2022-02-21 03:27:10,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {3473#true} assume !(main_~i~0#1 >= 10); {3473#true} is VALID [2022-02-21 03:27:10,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {3473#true} assume !(main_~i~0#1 <= 0); {3473#true} is VALID [2022-02-21 03:27:10,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {3473#true} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {3473#true} is VALID [2022-02-21 03:27:10,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {3473#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {3473#true} is VALID [2022-02-21 03:27:10,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {3473#true} assume !(main_~i~0#1 >= 10); {3473#true} is VALID [2022-02-21 03:27:10,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {3473#true} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {3475#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:27:10,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {3475#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {3476#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:10,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {3476#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {3476#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:10,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {3476#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {3474#false} is VALID [2022-02-21 03:27:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:27:10,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:10,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246564347] [2022-02-21 03:27:10,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246564347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:27:10,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:27:10,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:27:10,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103762707] [2022-02-21 03:27:10,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:27:10,202 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:27:10,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2022-02-21 03:27:10,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:10,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381106547] [2022-02-21 03:27:10,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:10,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:10,208 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:10,238 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:10,238 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:10,238 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:10,238 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:10,238 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:10,239 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,239 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:10,239 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:10,239 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2022-02-21 03:27:10,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:10,239 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:10,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:10,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:10,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:10,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:10,303 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:10,304 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:10,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:10,322 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:10,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:27:10,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:10,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:10,331 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:10,331 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:27:10,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:27:10,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:10,349 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:10,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:27:10,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:10,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:10,364 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:10,364 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:27:10,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:27:10,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:10,381 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:10,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:27:10,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:10,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:10,404 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:10,404 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:27:10,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:27:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:10,425 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:10,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:27:10,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:10,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:10,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 03:27:10,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:10,452 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:10,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:27:10,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:10,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:10,536 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:10,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:10,540 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:10,540 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:10,540 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:10,540 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:10,540 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:10,540 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,540 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:10,540 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:10,540 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2022-02-21 03:27:10,540 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:10,540 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:10,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:10,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:10,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:10,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:10,592 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:10,592 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:10,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:10,593 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:10,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:27:10,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:10,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:10,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:10,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:10,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:10,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:10,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:10,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:10,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:10,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 03:27:10,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:10,626 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:10,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:27:10,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:10,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:10,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:10,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:10,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:10,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:27:10,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:27:10,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:10,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:10,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:10,669 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:10,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:27:10,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:10,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:10,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:10,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:10,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:10,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:10,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:10,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:10,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:10,708 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:10,708 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:27:10,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:10,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:10,709 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:10,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:27:10,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:10,711 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:10,711 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:10,711 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:27:10,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:10,731 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:10,735 INFO L390 LassoCheck]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10);" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2022-02-21 03:27:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:10,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:10,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:10,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {3479#unseeded} assume { :begin_inline_ULTIMATE.init } true; {3479#unseeded} is VALID [2022-02-21 03:27:10,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {3479#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {3479#unseeded} is VALID [2022-02-21 03:27:10,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {3479#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {3479#unseeded} is VALID [2022-02-21 03:27:10,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {3479#unseeded} assume !(main_~i~0#1 >= 10); {3479#unseeded} is VALID [2022-02-21 03:27:10,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {3479#unseeded} assume !(main_~i~0#1 <= 0); {3479#unseeded} is VALID [2022-02-21 03:27:10,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {3479#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {3479#unseeded} is VALID [2022-02-21 03:27:10,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {3479#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {3479#unseeded} is VALID [2022-02-21 03:27:10,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {3479#unseeded} assume !(main_~i~0#1 >= 10); {3479#unseeded} is VALID [2022-02-21 03:27:10,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {3479#unseeded} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {3479#unseeded} is VALID [2022-02-21 03:27:10,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#unseeded} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {3479#unseeded} is VALID [2022-02-21 03:27:10,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {3479#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {3479#unseeded} is VALID [2022-02-21 03:27:10,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {3479#unseeded} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {3479#unseeded} is VALID [2022-02-21 03:27:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:10,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:10,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:10,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {3482#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {3482#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:10,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {3482#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {3533#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:10,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {3533#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {3533#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:10,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {3533#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {3492#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:27:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:10,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:10,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,837 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 [2022-02-21 03:27:10,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,882 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 188 states and 256 transitions. Complement of second has 7 states. [2022-02-21 03:27:10,883 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 [2022-02-21 03:27:10,883 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:10,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 112 transitions. cyclomatic complexity: 32 [2022-02-21 03:27:10,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:10,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:10,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:10,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:10,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:10,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 256 transitions. [2022-02-21 03:27:10,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-02-21 03:27:10,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:10,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:10,885 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 86 states and 112 transitions. cyclomatic complexity: 32 [2022-02-21 03:27:10,887 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:27:10,887 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:10,888 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:10,888 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 188 states and 256 transitions. cyclomatic complexity: 79 [2022-02-21 03:27:10,891 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:27:10,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:27:10,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:27:10,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:27:10,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 188 letters. Loop has 188 letters. [2022-02-21 03:27:10,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 188 letters. Loop has 188 letters. [2022-02-21 03:27:10,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 188 letters. Loop has 188 letters. [2022-02-21 03:27:10,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 86 letters. Loop has 86 letters. [2022-02-21 03:27:10,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 86 letters. [2022-02-21 03:27:10,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 86 letters. Loop has 86 letters. [2022-02-21 03:27:10,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:10,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:10,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:10,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:27:10,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:10,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:10,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:10,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:10,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:10,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:10,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:10,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:10,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:10,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 24 letters. Loop has 16 letters. [2022-02-21 03:27:10,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 16 letters. [2022-02-21 03:27:10,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 24 letters. Loop has 16 letters. [2022-02-21 03:27:10,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 23 letters. Loop has 12 letters. [2022-02-21 03:27:10,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 12 letters. [2022-02-21 03:27:10,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 23 letters. Loop has 12 letters. [2022-02-21 03:27:10,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 12 letters. [2022-02-21 03:27:10,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 12 letters. [2022-02-21 03:27:10,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 22 letters. Loop has 12 letters. [2022-02-21 03:27:10,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 12 letters. [2022-02-21 03:27:10,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 12 letters. [2022-02-21 03:27:10,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 21 letters. Loop has 12 letters. [2022-02-21 03:27:10,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 12 letters. [2022-02-21 03:27:10,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 12 letters. [2022-02-21 03:27:10,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 20 letters. Loop has 12 letters. [2022-02-21 03:27:10,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:27:10,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:27:10,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:27:10,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:27:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:27:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:27:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:27:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:27:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:27:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:27:10,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:10,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:27:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:27:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:27:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:27:10,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:27:10,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:27:10,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:27:10,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:10,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:27:10,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:27:10,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 29 letters. Loop has 8 letters. [2022-02-21 03:27:10,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:10,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:10,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 30 letters. Loop has 8 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 8 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 30 letters. Loop has 8 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 32 letters. Loop has 12 letters. [2022-02-21 03:27:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 12 letters. [2022-02-21 03:27:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 32 letters. Loop has 12 letters. [2022-02-21 03:27:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 33 letters. Loop has 12 letters. [2022-02-21 03:27:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 12 letters. [2022-02-21 03:27:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 33 letters. Loop has 12 letters. [2022-02-21 03:27:10,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 34 letters. Loop has 12 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 12 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 34 letters. Loop has 12 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 36 letters. Loop has 16 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 16 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 36 letters. Loop has 16 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:27:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 86 states and 112 transitions. cyclomatic complexity: 32 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 256 transitions. cyclomatic complexity: 79 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:27:10,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,958 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:27:10,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:27:10,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:27:10,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:27:10,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:10,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 256 transitions. cyclomatic complexity: 79 [2022-02-21 03:27:10,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-02-21 03:27:10,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 140 states and 182 transitions. [2022-02-21 03:27:10,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-02-21 03:27:10,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2022-02-21 03:27:10,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2022-02-21 03:27:10,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:10,963 INFO L681 BuchiCegarLoop]: Abstraction has 140 states and 182 transitions. [2022-02-21 03:27:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2022-02-21 03:27:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 94. [2022-02-21 03:27:10,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:10,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states and 182 transitions. Second operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,965 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states and 182 transitions. Second operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,965 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,965 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:10,973 INFO L93 Difference]: Finished difference Result 151 states and 193 transitions. [2022-02-21 03:27:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 193 transitions. [2022-02-21 03:27:10,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:10,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:10,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 140 states and 182 transitions. [2022-02-21 03:27:10,974 INFO L87 Difference]: Start difference. First operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 140 states and 182 transitions. [2022-02-21 03:27:10,974 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:10,976 INFO L93 Difference]: Finished difference Result 153 states and 195 transitions. [2022-02-21 03:27:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 195 transitions. [2022-02-21 03:27:10,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:10,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:10,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:10,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2022-02-21 03:27:10,977 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 124 transitions. [2022-02-21 03:27:10,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:27:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:27:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:27:10,978 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:27:11,010 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2022-02-21 03:27:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:27:11,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:11,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:11,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 132 transitions. [2022-02-21 03:27:11,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-02-21 03:27:11,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 103 states and 130 transitions. [2022-02-21 03:27:11,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-02-21 03:27:11,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-02-21 03:27:11,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 130 transitions. [2022-02-21 03:27:11,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:11,024 INFO L681 BuchiCegarLoop]: Abstraction has 103 states and 130 transitions. [2022-02-21 03:27:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 130 transitions. [2022-02-21 03:27:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2022-02-21 03:27:11,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:11,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states and 130 transitions. Second operand has 94 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 93 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:11,026 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states and 130 transitions. Second operand has 94 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 93 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:11,026 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 94 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 93 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:11,026 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:11,027 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2022-02-21 03:27:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2022-02-21 03:27:11,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:11,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:11,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 93 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states and 130 transitions. [2022-02-21 03:27:11,028 INFO L87 Difference]: Start difference. First operand has 94 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 93 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states and 130 transitions. [2022-02-21 03:27:11,028 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:11,033 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2022-02-21 03:27:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2022-02-21 03:27:11,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:11,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:11,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:11,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 93 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2022-02-21 03:27:11,035 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 121 transitions. [2022-02-21 03:27:11,035 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 121 transitions. [2022-02-21 03:27:11,035 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:27:11,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 121 transitions. [2022-02-21 03:27:11,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-02-21 03:27:11,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:11,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:11,036 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2022-02-21 03:27:11,036 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:27:11,036 INFO L791 eck$LassoCheckResult]: Stem: 4478#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4487#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4497#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 4498#L12-2 assume !(main_~i~0#1 <= 0); 4519#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4518#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4517#L12 assume !(main_~i~0#1 >= 10); 4516#L12-2 assume !(main_~i~0#1 <= 0); 4515#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4514#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4513#L12 assume !(main_~i~0#1 >= 10); 4512#L12-2 assume !(main_~i~0#1 <= 0); 4511#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4510#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4509#L12 assume !(main_~i~0#1 >= 10); 4505#L12-2 assume !(main_~i~0#1 <= 0); 4508#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4507#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4504#L12 assume !(main_~i~0#1 >= 10); 4503#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 4502#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4493#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4484#L12 assume !(main_~i~0#1 >= 10); 4476#L12-2 assume !(main_~i~0#1 <= 0); 4477#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4482#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4483#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 4474#L12-2 [2022-02-21 03:27:11,036 INFO L793 eck$LassoCheckResult]: Loop: 4474#L12-2 assume !(main_~i~0#1 <= 0); 4475#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4494#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4553#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 4474#L12-2 [2022-02-21 03:27:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1054469156, now seen corresponding path program 2 times [2022-02-21 03:27:11,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:11,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495174158] [2022-02-21 03:27:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:11,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {4972#true} assume { :begin_inline_ULTIMATE.init } true; {4972#true} is VALID [2022-02-21 03:27:11,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {4972#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {4972#true} is VALID [2022-02-21 03:27:11,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {4972#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4972#true} is VALID [2022-02-21 03:27:11,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {4972#true} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {4974#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {4974#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {4974#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {4974#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {4973#false} is VALID [2022-02-21 03:27:11,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {4973#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {4973#false} is VALID [2022-02-21 03:27:11,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {4973#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4973#false} is VALID [2022-02-21 03:27:11,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {4973#false} assume !(main_~i~0#1 >= 10); {4973#false} is VALID [2022-02-21 03:27:11,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {4973#false} assume !(main_~i~0#1 <= 0); {4973#false} is VALID [2022-02-21 03:27:11,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {4973#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {4973#false} is VALID [2022-02-21 03:27:11,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {4973#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4973#false} is VALID [2022-02-21 03:27:11,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {4973#false} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {4973#false} is VALID [2022-02-21 03:27:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:27:11,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:11,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495174158] [2022-02-21 03:27:11,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495174158] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:27:11,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788768993] [2022-02-21 03:27:11,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:27:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:27:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:11,091 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:27:11,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:27:11,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:27:11,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:27:11,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-02-21 03:27:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:11,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:11,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {4972#true} assume { :begin_inline_ULTIMATE.init } true; {4972#true} is VALID [2022-02-21 03:27:11,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {4972#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {4972#true} is VALID [2022-02-21 03:27:11,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {4972#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4972#true} is VALID [2022-02-21 03:27:11,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {4972#true} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {4974#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {4974#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {4974#(<= 10 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {4974#(<= 10 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {4975#(<= 9 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {4976#(<= 8 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {4977#(<= 7 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {4978#(<= 6 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {4973#false} is VALID [2022-02-21 03:27:11,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {4973#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {4973#false} is VALID [2022-02-21 03:27:11,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {4973#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4973#false} is VALID [2022-02-21 03:27:11,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {4973#false} assume !(main_~i~0#1 >= 10); {4973#false} is VALID [2022-02-21 03:27:11,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {4973#false} assume !(main_~i~0#1 <= 0); {4973#false} is VALID [2022-02-21 03:27:11,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {4973#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {4973#false} is VALID [2022-02-21 03:27:11,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {4973#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4973#false} is VALID [2022-02-21 03:27:11,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {4973#false} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {4973#false} is VALID [2022-02-21 03:27:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:27:11,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:27:11,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {4973#false} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {4973#false} is VALID [2022-02-21 03:27:11,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {4973#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4973#false} is VALID [2022-02-21 03:27:11,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {4973#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {4973#false} is VALID [2022-02-21 03:27:11,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {4973#false} assume !(main_~i~0#1 <= 0); {4973#false} is VALID [2022-02-21 03:27:11,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {4973#false} assume !(main_~i~0#1 >= 10); {4973#false} is VALID [2022-02-21 03:27:11,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {4973#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4973#false} is VALID [2022-02-21 03:27:11,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {4973#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {4973#false} is VALID [2022-02-21 03:27:11,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {5084#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {4973#false} is VALID [2022-02-21 03:27:11,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {5084#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !(main_~i~0#1 >= 10); {5084#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:27:11,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {5084#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5084#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:27:11,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {5094#(< 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5084#(not (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:27:11,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {5094#(< 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {5094#(< 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {5094#(< 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {5094#(< 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {5094#(< 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5094#(< 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {5107#(< 2 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5094#(< 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {5107#(< 2 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {5107#(< 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {5107#(< 2 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {5107#(< 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {5107#(< 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5107#(< 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {5120#(< 3 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5107#(< 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {5120#(< 3 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {5120#(< 3 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {5120#(< 3 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 10); {5120#(< 3 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {5120#(< 3 |ULTIMATE.start_main_~i~0#1|)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5120#(< 3 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {5133#(< 4 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5120#(< 3 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {5133#(< 4 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {5133#(< 4 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {4972#true} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5133#(< 4 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:11,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {4972#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {4972#true} is VALID [2022-02-21 03:27:11,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {4972#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {4972#true} is VALID [2022-02-21 03:27:11,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {4972#true} assume { :begin_inline_ULTIMATE.init } true; {4972#true} is VALID [2022-02-21 03:27:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:27:11,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788768993] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:27:11,452 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:27:11,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-02-21 03:27:11,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539536858] [2022-02-21 03:27:11,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:27:11,453 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:27:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2022-02-21 03:27:11,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:11,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391794961] [2022-02-21 03:27:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:11,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:11,468 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:11,522 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:11,522 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:11,522 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:11,522 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:11,522 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:11,522 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:11,522 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:11,522 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:11,522 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2022-02-21 03:27:11,523 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:11,523 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:11,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:11,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:11,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:11,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:11,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:11,598 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:11,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:11,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:11,599 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:11,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:27:11,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:11,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:11,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:11,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:11,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:11,639 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:11,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:27:11,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:11,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:11,803 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:11,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:11,808 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:11,808 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:11,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:11,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:11,808 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:11,808 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:11,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:11,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:11,808 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2022-02-21 03:27:11,808 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:11,808 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:11,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:11,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:11,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:11,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:11,873 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:11,873 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:11,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:11,874 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:11,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:27:11,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:11,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:11,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:11,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:11,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:11,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:11,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:11,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:11,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:11,889 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:11,889 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:27:11,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:11,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:11,890 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:11,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:27:11,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:11,892 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:11,892 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:11,892 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:27:11,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:11,931 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:11,934 INFO L390 LassoCheck]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10);" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2022-02-21 03:27:11,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:11,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:11,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:12,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {5148#unseeded} assume { :begin_inline_ULTIMATE.init } true; {5148#unseeded} is VALID [2022-02-21 03:27:12,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {5148#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {5148#unseeded} is VALID [2022-02-21 03:27:12,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {5148#unseeded} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5148#unseeded} is VALID [2022-02-21 03:27:12,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {5148#unseeded} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {5148#unseeded} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {5148#unseeded} is VALID [2022-02-21 03:27:12,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {5148#unseeded} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {5148#unseeded} is VALID [2022-02-21 03:27:12,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {5148#unseeded} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5148#unseeded} is VALID [2022-02-21 03:27:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:12,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {5151#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {5151#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:12,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {5151#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5250#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:12,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {5250#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5250#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:12,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {5250#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5161#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:27:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:12,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:12,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,092 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 [2022-02-21 03:27:12,092 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 148 states and 200 transitions. Complement of second has 7 states. [2022-02-21 03:27:12,126 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 [2022-02-21 03:27:12,126 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:12,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 121 transitions. cyclomatic complexity: 35 [2022-02-21 03:27:12,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:12,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 200 transitions. [2022-02-21 03:27:12,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-02-21 03:27:12,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,129 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 94 states and 121 transitions. cyclomatic complexity: 35 [2022-02-21 03:27:12,132 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:27:12,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:12,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:12,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 148 states and 200 transitions. cyclomatic complexity: 61 [2022-02-21 03:27:12,136 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:27:12,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 148 letters. Loop has 148 letters. [2022-02-21 03:27:12,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 148 letters. [2022-02-21 03:27:12,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 148 letters. Loop has 148 letters. [2022-02-21 03:27:12,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 94 letters. Loop has 94 letters. [2022-02-21 03:27:12,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 94 letters. [2022-02-21 03:27:12,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 94 letters. [2022-02-21 03:27:12,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:12,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:12,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:12,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 200 transitions. cyclomatic complexity: 61 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,173 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:27:12,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,174 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:27:12,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:12,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {5148#unseeded} assume { :begin_inline_ULTIMATE.init } true; {5148#unseeded} is VALID [2022-02-21 03:27:12,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {5148#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {5148#unseeded} is VALID [2022-02-21 03:27:12,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {5148#unseeded} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5148#unseeded} is VALID [2022-02-21 03:27:12,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {5148#unseeded} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {5148#unseeded} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {5148#unseeded} is VALID [2022-02-21 03:27:12,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {5148#unseeded} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {5148#unseeded} is VALID [2022-02-21 03:27:12,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {5148#unseeded} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5148#unseeded} is VALID [2022-02-21 03:27:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:12,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {5151#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {5151#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:12,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {5151#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5503#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:12,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {5503#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5503#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:12,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {5503#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5161#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:27:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:12,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:12,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,286 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:27:12,286 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,325 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 173 states and 212 transitions. Complement of second has 7 states. [2022-02-21 03:27:12,325 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 [2022-02-21 03:27:12,325 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:12,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 121 transitions. cyclomatic complexity: 35 [2022-02-21 03:27:12,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:12,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 212 transitions. [2022-02-21 03:27:12,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-02-21 03:27:12,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,327 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 94 states and 121 transitions. cyclomatic complexity: 35 [2022-02-21 03:27:12,327 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:27:12,327 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:12,328 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:12,328 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 173 states and 212 transitions. cyclomatic complexity: 50 [2022-02-21 03:27:12,330 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:27:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 173 letters. Loop has 173 letters. [2022-02-21 03:27:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 173 letters. Loop has 173 letters. [2022-02-21 03:27:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 173 letters. Loop has 173 letters. [2022-02-21 03:27:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 94 letters. Loop has 94 letters. [2022-02-21 03:27:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 94 letters. [2022-02-21 03:27:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 94 letters. Loop has 94 letters. [2022-02-21 03:27:12,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:12,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:12,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:12,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:27:12,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:27:12,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:27:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:27:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:27:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:27:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 173 states and 212 transitions. cyclomatic complexity: 50 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,362 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-02-21 03:27:12,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,363 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:27:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:12,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {5148#unseeded} assume { :begin_inline_ULTIMATE.init } true; {5148#unseeded} is VALID [2022-02-21 03:27:12,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {5148#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {5148#unseeded} is VALID [2022-02-21 03:27:12,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {5148#unseeded} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5148#unseeded} is VALID [2022-02-21 03:27:12,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {5148#unseeded} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {5148#unseeded} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {5148#unseeded} is VALID [2022-02-21 03:27:12,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {5148#unseeded} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {5148#unseeded} is VALID [2022-02-21 03:27:12,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {5148#unseeded} assume !(main_~i~0#1 >= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {5148#unseeded} assume !(main_~i~0#1 <= 0); {5148#unseeded} is VALID [2022-02-21 03:27:12,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {5148#unseeded} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {5148#unseeded} is VALID [2022-02-21 03:27:12,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {5148#unseeded} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5148#unseeded} is VALID [2022-02-21 03:27:12,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {5148#unseeded} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5148#unseeded} is VALID [2022-02-21 03:27:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:12,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {5151#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 <= 0); {5151#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:27:12,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {5151#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {5781#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:12,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {5781#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {5781#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} is VALID [2022-02-21 03:27:12,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {5781#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) oldRank0)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {5161#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:27:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:12,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:12,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,472 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:27:12,472 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,506 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 163 states and 221 transitions. Complement of second has 8 states. [2022-02-21 03:27:12,506 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 [2022-02-21 03:27:12,506 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:12,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 121 transitions. cyclomatic complexity: 35 [2022-02-21 03:27:12,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:12,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 221 transitions. [2022-02-21 03:27:12,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-02-21 03:27:12,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,508 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 94 states and 121 transitions. cyclomatic complexity: 35 [2022-02-21 03:27:12,509 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:27:12,509 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:27:12,509 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:12,509 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 163 states and 221 transitions. cyclomatic complexity: 67 [2022-02-21 03:27:12,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:27:12,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:27:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:27:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:27:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 163 letters. Loop has 163 letters. [2022-02-21 03:27:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 163 letters. Loop has 163 letters. [2022-02-21 03:27:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 163 letters. Loop has 163 letters. [2022-02-21 03:27:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 94 letters. Loop has 94 letters. [2022-02-21 03:27:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 94 letters. [2022-02-21 03:27:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 94 letters. Loop has 94 letters. [2022-02-21 03:27:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 35 letters. Loop has 8 letters. [2022-02-21 03:27:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 34 letters. Loop has 8 letters. [2022-02-21 03:27:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:27:12,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:27:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:27:12,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:27:12,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:27:12,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:27:12,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 40 letters. Loop has 16 letters. [2022-02-21 03:27:12,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 39 letters. Loop has 12 letters. [2022-02-21 03:27:12,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 38 letters. Loop has 12 letters. [2022-02-21 03:27:12,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:27:12,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 37 letters. Loop has 12 letters. [2022-02-21 03:27:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:27:12,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:27:12,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 33 letters. Loop has 4 letters. [2022-02-21 03:27:12,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:27:12,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:27:12,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:27:12,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:27:12,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:27:12,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:27:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:27:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:27:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:27:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:27:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:27:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 121 transitions. cyclomatic complexity: 35 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 221 transitions. cyclomatic complexity: 67 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,540 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-21 03:27:12,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:27:12,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:27:12,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:27:12,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:12,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 221 transitions. cyclomatic complexity: 67 [2022-02-21 03:27:12,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-02-21 03:27:12,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 115 states and 147 transitions. [2022-02-21 03:27:12,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-02-21 03:27:12,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 03:27:12,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 147 transitions. [2022-02-21 03:27:12,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:12,545 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 147 transitions. [2022-02-21 03:27:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 147 transitions. [2022-02-21 03:27:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 61. [2022-02-21 03:27:12,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:12,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states and 147 transitions. Second operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,547 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states and 147 transitions. Second operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,547 INFO L87 Difference]: Start difference. First operand 115 states and 147 transitions. Second operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,547 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:12,548 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2022-02-21 03:27:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2022-02-21 03:27:12,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:12,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:12,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states and 147 transitions. [2022-02-21 03:27:12,549 INFO L87 Difference]: Start difference. First operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states and 147 transitions. [2022-02-21 03:27:12,549 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:12,551 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2022-02-21 03:27:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2022-02-21 03:27:12,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:12,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:12,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:12,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-02-21 03:27:12,552 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-02-21 03:27:12,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:27:12,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:27:12,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:27:12,553 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:27:12,688 INFO L93 Difference]: Finished difference Result 195 states and 238 transitions. [2022-02-21 03:27:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:27:12,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:12,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 238 transitions. [2022-02-21 03:27:12,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2022-02-21 03:27:12,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 182 states and 225 transitions. [2022-02-21 03:27:12,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2022-02-21 03:27:12,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-02-21 03:27:12,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 225 transitions. [2022-02-21 03:27:12,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:12,727 INFO L681 BuchiCegarLoop]: Abstraction has 182 states and 225 transitions. [2022-02-21 03:27:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 225 transitions. [2022-02-21 03:27:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2022-02-21 03:27:12,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:12,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states and 225 transitions. Second operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,729 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states and 225 transitions. Second operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,729 INFO L87 Difference]: Start difference. First operand 182 states and 225 transitions. Second operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,729 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:12,732 INFO L93 Difference]: Finished difference Result 184 states and 227 transitions. [2022-02-21 03:27:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 227 transitions. [2022-02-21 03:27:12,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:12,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:12,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states and 225 transitions. [2022-02-21 03:27:12,732 INFO L87 Difference]: Start difference. First operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states and 225 transitions. [2022-02-21 03:27:12,733 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:12,735 INFO L93 Difference]: Finished difference Result 184 states and 227 transitions. [2022-02-21 03:27:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 227 transitions. [2022-02-21 03:27:12,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:12,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:12,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:12,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 211 transitions. [2022-02-21 03:27:12,737 INFO L704 BuchiCegarLoop]: Abstraction has 168 states and 211 transitions. [2022-02-21 03:27:12,737 INFO L587 BuchiCegarLoop]: Abstraction has 168 states and 211 transitions. [2022-02-21 03:27:12,737 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:27:12,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 211 transitions. [2022-02-21 03:27:12,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2022-02-21 03:27:12,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:12,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:12,738 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2022-02-21 03:27:12,739 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2022-02-21 03:27:12,739 INFO L791 eck$LassoCheckResult]: Stem: 6650#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6651#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 6658#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6663#L12 assume !(main_~i~0#1 >= 10); 6667#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 6665#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6652#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6653#L12 assume !(main_~i~0#1 >= 10); 6758#L12-2 assume !(main_~i~0#1 <= 0); 6759#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6754#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6712#L12 [2022-02-21 03:27:12,739 INFO L793 eck$LassoCheckResult]: Loop: 6712#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 6711#L12-2 assume !(main_~i~0#1 <= 0); 6649#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6654#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6655#L12 assume !(main_~i~0#1 >= 10); 6661#L12-2 assume !(main_~i~0#1 <= 0); 6753#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6752#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6751#L12 assume !(main_~i~0#1 >= 10); 6750#L12-2 assume !(main_~i~0#1 <= 0); 6749#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6748#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6747#L12 assume !(main_~i~0#1 >= 10); 6746#L12-2 assume !(main_~i~0#1 <= 0); 6745#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6744#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6743#L12 assume !(main_~i~0#1 >= 10); 6742#L12-2 assume !(main_~i~0#1 <= 0); 6741#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6740#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6739#L12 assume !(main_~i~0#1 >= 10); 6738#L12-2 assume !(main_~i~0#1 <= 0); 6737#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6736#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6735#L12 assume !(main_~i~0#1 >= 10); 6734#L12-2 assume !(main_~i~0#1 <= 0); 6733#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6732#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6731#L12 assume !(main_~i~0#1 >= 10); 6730#L12-2 assume !(main_~i~0#1 <= 0); 6729#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6728#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6727#L12 assume !(main_~i~0#1 >= 10); 6726#L12-2 assume !(main_~i~0#1 <= 0); 6725#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6724#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6723#L12 assume !(main_~i~0#1 >= 10); 6720#L12-2 assume !(main_~i~0#1 <= 0); 6722#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 6721#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6719#L12 assume !(main_~i~0#1 >= 10); 6716#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 6714#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6715#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6717#L12 assume !(main_~i~0#1 >= 10); 6718#L12-2 assume !(main_~i~0#1 <= 0); 6813#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6812#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6785#L12 assume !(main_~i~0#1 >= 10); 6646#L12-2 assume !(main_~i~0#1 <= 0); 6647#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6664#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6786#L12 assume !(main_~i~0#1 >= 10); 6811#L12-2 assume !(main_~i~0#1 <= 0); 6810#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6809#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6808#L12 assume !(main_~i~0#1 >= 10); 6807#L12-2 assume !(main_~i~0#1 <= 0); 6806#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6805#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6804#L12 assume !(main_~i~0#1 >= 10); 6803#L12-2 assume !(main_~i~0#1 <= 0); 6802#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6801#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6800#L12 assume !(main_~i~0#1 >= 10); 6799#L12-2 assume !(main_~i~0#1 <= 0); 6798#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6797#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6796#L12 assume !(main_~i~0#1 >= 10); 6795#L12-2 assume !(main_~i~0#1 <= 0); 6794#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6793#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6792#L12 assume !(main_~i~0#1 >= 10); 6791#L12-2 assume !(main_~i~0#1 <= 0); 6790#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6789#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6788#L12 assume !(main_~i~0#1 >= 10); 6660#L12-2 assume !(main_~i~0#1 <= 0); 6787#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 6713#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 6712#L12 [2022-02-21 03:27:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash 474307092, now seen corresponding path program 1 times [2022-02-21 03:27:12,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:12,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383960376] [2022-02-21 03:27:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:12,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:12,746 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:12,748 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:12,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 1 times [2022-02-21 03:27:12,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:12,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694883678] [2022-02-21 03:27:12,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:12,783 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:12,800 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash -68907892, now seen corresponding path program 3 times [2022-02-21 03:27:12,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:12,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111135547] [2022-02-21 03:27:12,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:12,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {7533#true} assume { :begin_inline_ULTIMATE.init } true; {7533#true} is VALID [2022-02-21 03:27:12,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {7533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {7533#true} is VALID [2022-02-21 03:27:12,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {7533#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7533#true} is VALID [2022-02-21 03:27:12,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {7533#true} assume !(main_~i~0#1 >= 10); {7533#true} is VALID [2022-02-21 03:27:12,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {7533#true} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {7535#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:27:12,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {7535#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:12,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:12,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 >= 10); {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:12,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 <= 0); {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:12,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7537#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:12,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {7537#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7537#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:12,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {7537#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {7534#false} is VALID [2022-02-21 03:27:12,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 50: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 52: Hoare triple {7534#false} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 54: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,904 INFO L290 TraceCheckUtils]: 55: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,905 INFO L290 TraceCheckUtils]: 56: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,919 INFO L290 TraceCheckUtils]: 59: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,919 INFO L290 TraceCheckUtils]: 60: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 62: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 63: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 66: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 69: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 70: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,920 INFO L290 TraceCheckUtils]: 71: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,921 INFO L290 TraceCheckUtils]: 72: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,921 INFO L290 TraceCheckUtils]: 73: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,921 INFO L290 TraceCheckUtils]: 74: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,921 INFO L290 TraceCheckUtils]: 75: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,921 INFO L290 TraceCheckUtils]: 76: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,921 INFO L290 TraceCheckUtils]: 77: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,921 INFO L290 TraceCheckUtils]: 78: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,921 INFO L290 TraceCheckUtils]: 79: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,921 INFO L290 TraceCheckUtils]: 80: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 81: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 82: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 83: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 84: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 85: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 86: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 87: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 88: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 89: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:12,922 INFO L290 TraceCheckUtils]: 90: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2022-02-21 03:27:12,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:12,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111135547] [2022-02-21 03:27:12,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111135547] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:27:12,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859765490] [2022-02-21 03:27:12,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:27:12,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:27:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:12,925 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:27:12,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-02-21 03:27:12,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:27:12,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:27:12,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:12,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:13,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {7533#true} assume { :begin_inline_ULTIMATE.init } true; {7533#true} is VALID [2022-02-21 03:27:13,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {7533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {7533#true} is VALID [2022-02-21 03:27:13,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {7533#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7533#true} is VALID [2022-02-21 03:27:13,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {7533#true} assume !(main_~i~0#1 >= 10); {7533#true} is VALID [2022-02-21 03:27:13,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {7533#true} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {7535#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:27:13,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {7535#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:13,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:13,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 >= 10); {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:13,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 <= 0); {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:13,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {7536#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7537#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:13,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {7537#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7537#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:13,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {7537#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {7534#false} is VALID [2022-02-21 03:27:13,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 47: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,151 INFO L290 TraceCheckUtils]: 52: Hoare triple {7534#false} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {7534#false} is VALID [2022-02-21 03:27:13,151 INFO L290 TraceCheckUtils]: 53: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 68: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,153 INFO L290 TraceCheckUtils]: 70: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,153 INFO L290 TraceCheckUtils]: 71: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,153 INFO L290 TraceCheckUtils]: 72: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,153 INFO L290 TraceCheckUtils]: 73: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,153 INFO L290 TraceCheckUtils]: 74: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,153 INFO L290 TraceCheckUtils]: 75: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,153 INFO L290 TraceCheckUtils]: 77: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,154 INFO L290 TraceCheckUtils]: 82: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,154 INFO L290 TraceCheckUtils]: 83: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,154 INFO L290 TraceCheckUtils]: 84: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,154 INFO L290 TraceCheckUtils]: 85: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,154 INFO L290 TraceCheckUtils]: 86: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,154 INFO L290 TraceCheckUtils]: 87: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,155 INFO L290 TraceCheckUtils]: 88: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,155 INFO L290 TraceCheckUtils]: 90: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2022-02-21 03:27:13,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:27:13,345 INFO L290 TraceCheckUtils]: 90: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,345 INFO L290 TraceCheckUtils]: 89: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,345 INFO L290 TraceCheckUtils]: 88: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,345 INFO L290 TraceCheckUtils]: 87: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,345 INFO L290 TraceCheckUtils]: 86: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,345 INFO L290 TraceCheckUtils]: 85: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,345 INFO L290 TraceCheckUtils]: 84: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 83: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 82: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 81: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 80: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 79: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 78: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 77: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 76: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 75: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,346 INFO L290 TraceCheckUtils]: 74: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,347 INFO L290 TraceCheckUtils]: 73: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,347 INFO L290 TraceCheckUtils]: 72: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,347 INFO L290 TraceCheckUtils]: 71: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,347 INFO L290 TraceCheckUtils]: 69: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,347 INFO L290 TraceCheckUtils]: 68: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,347 INFO L290 TraceCheckUtils]: 67: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,348 INFO L290 TraceCheckUtils]: 64: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,348 INFO L290 TraceCheckUtils]: 63: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,348 INFO L290 TraceCheckUtils]: 62: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,348 INFO L290 TraceCheckUtils]: 60: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,348 INFO L290 TraceCheckUtils]: 59: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,348 INFO L290 TraceCheckUtils]: 58: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,348 INFO L290 TraceCheckUtils]: 57: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,348 INFO L290 TraceCheckUtils]: 56: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {7534#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {7534#false} is VALID [2022-02-21 03:27:13,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {7534#false} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {7534#false} is VALID [2022-02-21 03:27:13,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {7534#false} assume !(main_~i~0#1 >= 10); {7534#false} is VALID [2022-02-21 03:27:13,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {7534#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7534#false} is VALID [2022-02-21 03:27:13,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {7534#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {7534#false} is VALID [2022-02-21 03:27:13,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {7534#false} assume !(main_~i~0#1 <= 0); {7534#false} is VALID [2022-02-21 03:27:13,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {8048#(not (<= 10 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {7534#false} is VALID [2022-02-21 03:27:13,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {8048#(not (<= 10 |ULTIMATE.start_main_~i~0#1|))} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {8048#(not (<= 10 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:27:13,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {8055#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {8048#(not (<= 10 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:27:13,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {8055#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~i~0#1 <= 0); {8055#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:13,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {8055#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~i~0#1 >= 10); {8055#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:13,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {8055#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {8055#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:13,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {8068#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {8055#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:13,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {7533#true} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {8068#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:27:13,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {7533#true} assume !(main_~i~0#1 >= 10); {7533#true} is VALID [2022-02-21 03:27:13,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {7533#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {7533#true} is VALID [2022-02-21 03:27:13,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {7533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {7533#true} is VALID [2022-02-21 03:27:13,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {7533#true} assume { :begin_inline_ULTIMATE.init } true; {7533#true} is VALID [2022-02-21 03:27:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2022-02-21 03:27:13,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859765490] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:27:13,357 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:27:13,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-02-21 03:27:13,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664567695] [2022-02-21 03:27:13,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:27:13,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:27:13,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:27:13,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:27:13,655 INFO L87 Difference]: Start difference. First operand 168 states and 211 transitions. cyclomatic complexity: 46 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:27:13,744 INFO L93 Difference]: Finished difference Result 179 states and 197 transitions. [2022-02-21 03:27:13,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:27:13,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:13,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:13,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 197 transitions. [2022-02-21 03:27:13,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2022-02-21 03:27:13,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 175 states and 193 transitions. [2022-02-21 03:27:13,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2022-02-21 03:27:13,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2022-02-21 03:27:13,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 193 transitions. [2022-02-21 03:27:13,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:13,766 INFO L681 BuchiCegarLoop]: Abstraction has 175 states and 193 transitions. [2022-02-21 03:27:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 193 transitions. [2022-02-21 03:27:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2022-02-21 03:27:13,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:13,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states and 193 transitions. Second operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:13,768 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states and 193 transitions. Second operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:13,768 INFO L87 Difference]: Start difference. First operand 175 states and 193 transitions. Second operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:13,768 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:13,770 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2022-02-21 03:27:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 199 transitions. [2022-02-21 03:27:13,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:13,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:13,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 175 states and 193 transitions. [2022-02-21 03:27:13,771 INFO L87 Difference]: Start difference. First operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 175 states and 193 transitions. [2022-02-21 03:27:13,771 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:13,773 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2022-02-21 03:27:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 199 transitions. [2022-02-21 03:27:13,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:13,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:13,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:13,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2022-02-21 03:27:13,776 INFO L704 BuchiCegarLoop]: Abstraction has 168 states and 185 transitions. [2022-02-21 03:27:13,776 INFO L587 BuchiCegarLoop]: Abstraction has 168 states and 185 transitions. [2022-02-21 03:27:13,776 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 03:27:13,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 185 transitions. [2022-02-21 03:27:13,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2022-02-21 03:27:13,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:13,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:13,777 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2022-02-21 03:27:13,777 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2022-02-21 03:27:13,777 INFO L791 eck$LassoCheckResult]: Stem: 8268#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8269#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 8273#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8285#L12 assume !(main_~i~0#1 >= 10); 8281#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 8278#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8280#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8414#L12 assume !(main_~i~0#1 >= 10); 8413#L12-2 assume !(main_~i~0#1 <= 0); 8276#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8277#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8412#L12 assume !(main_~i~0#1 >= 10); 8410#L12-2 assume !(main_~i~0#1 <= 0); 8411#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8405#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8274#L12 assume !(main_~i~0#1 >= 10); 8260#L12-2 assume !(main_~i~0#1 <= 0); 8261#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8409#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8408#L12 assume !(main_~i~0#1 >= 10); 8407#L12-2 assume !(main_~i~0#1 <= 0); 8406#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8264#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8265#L12 assume !(main_~i~0#1 >= 10); 8427#L12-2 assume !(main_~i~0#1 <= 0); 8426#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8415#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8328#L12 [2022-02-21 03:27:13,777 INFO L793 eck$LassoCheckResult]: Loop: 8328#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 8327#L12-2 assume !(main_~i~0#1 <= 0); 8272#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8266#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8267#L12 assume !(main_~i~0#1 >= 10); 8262#L12-2 assume !(main_~i~0#1 <= 0); 8263#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8404#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8403#L12 assume !(main_~i~0#1 >= 10); 8402#L12-2 assume !(main_~i~0#1 <= 0); 8401#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8400#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8399#L12 assume !(main_~i~0#1 >= 10); 8398#L12-2 assume !(main_~i~0#1 <= 0); 8397#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8396#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8395#L12 assume !(main_~i~0#1 >= 10); 8394#L12-2 assume !(main_~i~0#1 <= 0); 8393#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8392#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8391#L12 assume !(main_~i~0#1 >= 10); 8390#L12-2 assume !(main_~i~0#1 <= 0); 8389#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8388#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8387#L12 assume !(main_~i~0#1 >= 10); 8386#L12-2 assume !(main_~i~0#1 <= 0); 8385#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8384#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8383#L12 assume !(main_~i~0#1 >= 10); 8382#L12-2 assume !(main_~i~0#1 <= 0); 8381#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8380#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8379#L12 assume !(main_~i~0#1 >= 10); 8378#L12-2 assume !(main_~i~0#1 <= 0); 8377#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8376#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8375#L12 assume !(main_~i~0#1 >= 10); 8372#L12-2 assume !(main_~i~0#1 <= 0); 8374#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 8373#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8371#L12 assume !(main_~i~0#1 >= 10); 8370#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 8367#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8369#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8368#L12 assume !(main_~i~0#1 >= 10); 8366#L12-2 assume !(main_~i~0#1 <= 0); 8365#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8364#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8363#L12 assume !(main_~i~0#1 >= 10); 8362#L12-2 assume !(main_~i~0#1 <= 0); 8360#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8358#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8356#L12 assume !(main_~i~0#1 >= 10); 8354#L12-2 assume !(main_~i~0#1 <= 0); 8352#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8350#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8348#L12 assume !(main_~i~0#1 >= 10); 8346#L12-2 assume !(main_~i~0#1 <= 0); 8344#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8342#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8340#L12 assume !(main_~i~0#1 >= 10); 8339#L12-2 assume !(main_~i~0#1 <= 0); 8338#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8329#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8330#L12 assume !(main_~i~0#1 >= 10); 8341#L12-2 assume !(main_~i~0#1 <= 0); 8361#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8359#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8357#L12 assume !(main_~i~0#1 >= 10); 8355#L12-2 assume !(main_~i~0#1 <= 0); 8353#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8351#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8349#L12 assume !(main_~i~0#1 >= 10); 8347#L12-2 assume !(main_~i~0#1 <= 0); 8345#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8343#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8335#L12 assume !(main_~i~0#1 >= 10); 8336#L12-2 assume !(main_~i~0#1 <= 0); 8416#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 8337#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 8328#L12 [2022-02-21 03:27:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1514411024, now seen corresponding path program 2 times [2022-02-21 03:27:13,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:13,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613744305] [2022-02-21 03:27:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:13,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:13,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:13,793 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 2 times [2022-02-21 03:27:13,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:13,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117641205] [2022-02-21 03:27:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:13,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:13,835 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:13,836 INFO L85 PathProgramCache]: Analyzing trace with hash -883489176, now seen corresponding path program 4 times [2022-02-21 03:27:13,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:13,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629573017] [2022-02-21 03:27:13,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:13,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {9141#true} assume { :begin_inline_ULTIMATE.init } true; {9141#true} is VALID [2022-02-21 03:27:13,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {9141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {9141#true} is VALID [2022-02-21 03:27:13,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {9141#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9141#true} is VALID [2022-02-21 03:27:13,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {9141#true} assume !(main_~i~0#1 >= 10); {9141#true} is VALID [2022-02-21 03:27:13,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {9141#true} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {9143#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:27:13,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {9143#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:13,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:13,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 >= 10); {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:13,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 <= 0); {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:13,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:13,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:13,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 >= 10); {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:13,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 <= 0); {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:13,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:27:13,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:27:13,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 >= 10); {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:27:13,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 <= 0); {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:27:13,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:13,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:13,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 >= 10); {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:13,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 <= 0); {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:13,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:13,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:13,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 >= 10); {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:13,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 <= 0); {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:13,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:27:13,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:27:13,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {9142#false} is VALID [2022-02-21 03:27:13,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 55: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 61: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 62: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 63: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 64: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 65: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 66: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 67: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,951 INFO L290 TraceCheckUtils]: 68: Hoare triple {9142#false} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 69: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 70: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 71: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 72: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 73: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 74: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 75: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 76: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 77: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 79: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 80: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 81: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 82: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 83: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 84: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 85: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 86: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 87: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,953 INFO L290 TraceCheckUtils]: 88: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 89: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 90: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 91: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 92: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 93: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 94: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 95: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 96: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 97: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,954 INFO L290 TraceCheckUtils]: 98: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,955 INFO L290 TraceCheckUtils]: 99: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,955 INFO L290 TraceCheckUtils]: 100: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,955 INFO L290 TraceCheckUtils]: 101: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,955 INFO L290 TraceCheckUtils]: 102: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,955 INFO L290 TraceCheckUtils]: 103: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:13,955 INFO L290 TraceCheckUtils]: 104: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:13,955 INFO L290 TraceCheckUtils]: 105: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:13,955 INFO L290 TraceCheckUtils]: 106: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2022-02-21 03:27:13,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:27:13,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629573017] [2022-02-21 03:27:13,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629573017] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:27:13,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614628839] [2022-02-21 03:27:13,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:27:13,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:27:13,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:13,958 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:27:13,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-02-21 03:27:14,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:27:14,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:27:14,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:27:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:14,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:14,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {9141#true} assume { :begin_inline_ULTIMATE.init } true; {9141#true} is VALID [2022-02-21 03:27:14,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {9141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {9141#true} is VALID [2022-02-21 03:27:14,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {9141#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9141#true} is VALID [2022-02-21 03:27:14,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {9141#true} assume !(main_~i~0#1 >= 10); {9141#true} is VALID [2022-02-21 03:27:14,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {9141#true} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {9143#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:27:14,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {9143#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:14,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:14,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 >= 10); {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:14,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 <= 0); {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:27:14,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {9144#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:14,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:14,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 >= 10); {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:14,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 <= 0); {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:27:14,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {9145#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:27:14,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:27:14,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 >= 10); {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:27:14,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 <= 0); {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:27:14,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:14,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:14,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 >= 10); {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:14,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 <= 0); {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:14,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:14,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:14,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 >= 10); {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:14,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 <= 0); {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:14,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:27:14,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:27:14,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {9142#false} is VALID [2022-02-21 03:27:14,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,292 INFO L290 TraceCheckUtils]: 44: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,293 INFO L290 TraceCheckUtils]: 46: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,293 INFO L290 TraceCheckUtils]: 47: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 55: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 57: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 59: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 60: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,294 INFO L290 TraceCheckUtils]: 63: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 67: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 68: Hoare triple {9142#false} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 69: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 70: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 71: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 72: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,295 INFO L290 TraceCheckUtils]: 73: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 74: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 75: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 76: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 77: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 79: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 80: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 81: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 82: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,296 INFO L290 TraceCheckUtils]: 83: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 84: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 87: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 88: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 89: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 90: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 91: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 92: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,297 INFO L290 TraceCheckUtils]: 93: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 94: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 95: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 96: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 97: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 98: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 99: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 100: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 101: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 102: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,298 INFO L290 TraceCheckUtils]: 103: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,299 INFO L290 TraceCheckUtils]: 104: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,299 INFO L290 TraceCheckUtils]: 105: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,299 INFO L290 TraceCheckUtils]: 106: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2022-02-21 03:27:14,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 106: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 105: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 104: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 103: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 102: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 101: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 100: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 99: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 98: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,596 INFO L290 TraceCheckUtils]: 97: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,597 INFO L290 TraceCheckUtils]: 96: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,597 INFO L290 TraceCheckUtils]: 95: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,597 INFO L290 TraceCheckUtils]: 94: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,597 INFO L290 TraceCheckUtils]: 93: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,597 INFO L290 TraceCheckUtils]: 92: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,597 INFO L290 TraceCheckUtils]: 91: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,597 INFO L290 TraceCheckUtils]: 90: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,597 INFO L290 TraceCheckUtils]: 89: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,598 INFO L290 TraceCheckUtils]: 88: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,598 INFO L290 TraceCheckUtils]: 87: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,598 INFO L290 TraceCheckUtils]: 86: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,598 INFO L290 TraceCheckUtils]: 85: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,598 INFO L290 TraceCheckUtils]: 84: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,598 INFO L290 TraceCheckUtils]: 83: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,598 INFO L290 TraceCheckUtils]: 82: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,598 INFO L290 TraceCheckUtils]: 81: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,599 INFO L290 TraceCheckUtils]: 74: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,600 INFO L290 TraceCheckUtils]: 73: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,600 INFO L290 TraceCheckUtils]: 72: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,600 INFO L290 TraceCheckUtils]: 71: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,600 INFO L290 TraceCheckUtils]: 70: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,600 INFO L290 TraceCheckUtils]: 69: Hoare triple {9142#false} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9142#false} is VALID [2022-02-21 03:27:14,600 INFO L290 TraceCheckUtils]: 68: Hoare triple {9142#false} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {9142#false} is VALID [2022-02-21 03:27:14,600 INFO L290 TraceCheckUtils]: 67: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,600 INFO L290 TraceCheckUtils]: 66: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,600 INFO L290 TraceCheckUtils]: 65: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 60: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 59: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 58: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,601 INFO L290 TraceCheckUtils]: 55: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {9142#false} assume !(main_~i~0#1 >= 10); {9142#false} is VALID [2022-02-21 03:27:14,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {9142#false} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9142#false} is VALID [2022-02-21 03:27:14,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {9142#false} assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; {9142#false} is VALID [2022-02-21 03:27:14,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {9142#false} assume !(main_~i~0#1 <= 0); {9142#false} is VALID [2022-02-21 03:27:14,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {9708#(not (<= 10 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 >= 10;main_~up~0#1 := 0; {9142#false} is VALID [2022-02-21 03:27:14,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {9708#(not (<= 10 |ULTIMATE.start_main_~i~0#1|))} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9708#(not (<= 10 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:27:14,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {9715#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9708#(not (<= 10 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:27:14,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {9715#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~i~0#1 <= 0); {9715#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:14,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {9715#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~i~0#1 >= 10); {9715#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:14,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {9715#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9715#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:14,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {9728#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9715#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:27:14,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {9728#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~i~0#1 <= 0); {9728#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:27:14,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {9728#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~i~0#1 >= 10); {9728#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:27:14,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {9728#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9728#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:27:14,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9728#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:27:14,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~i~0#1 <= 0); {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:27:14,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~i~0#1 >= 10); {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:27:14,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:27:14,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9149#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:27:14,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 <= 0); {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:14,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 >= 10); {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:14,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:14,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9148#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:27:14,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 <= 0); {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:14,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 >= 10); {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:14,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:14,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; {9147#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:27:14,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {9141#true} assume main_~i~0#1 <= 0;main_~up~0#1 := 1; {9146#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:27:14,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {9141#true} assume !(main_~i~0#1 >= 10); {9141#true} is VALID [2022-02-21 03:27:14,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {9141#true} assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); {9141#true} is VALID [2022-02-21 03:27:14,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {9141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; {9141#true} is VALID [2022-02-21 03:27:14,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {9141#true} assume { :begin_inline_ULTIMATE.init } true; {9141#true} is VALID [2022-02-21 03:27:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2022-02-21 03:27:14,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614628839] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:27:14,614 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:27:14,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-02-21 03:27:14,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076732748] [2022-02-21 03:27:14,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:27:15,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:27:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:27:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:27:15,076 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:27:15,220 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-02-21 03:27:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:27:15,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:15,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:15,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 229 transitions. [2022-02-21 03:27:15,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2022-02-21 03:27:15,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 208 states and 223 transitions. [2022-02-21 03:27:15,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2022-02-21 03:27:15,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2022-02-21 03:27:15,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 223 transitions. [2022-02-21 03:27:15,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:15,255 INFO L681 BuchiCegarLoop]: Abstraction has 208 states and 223 transitions. [2022-02-21 03:27:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 223 transitions. [2022-02-21 03:27:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 167. [2022-02-21 03:27:15,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:15,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states and 223 transitions. Second operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:15,257 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states and 223 transitions. Second operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:15,257 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:15,257 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:15,260 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2022-02-21 03:27:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 224 transitions. [2022-02-21 03:27:15,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:15,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:15,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 208 states and 223 transitions. [2022-02-21 03:27:15,261 INFO L87 Difference]: Start difference. First operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 208 states and 223 transitions. [2022-02-21 03:27:15,261 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:15,263 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2022-02-21 03:27:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 224 transitions. [2022-02-21 03:27:15,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:15,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:15,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:15,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2022-02-21 03:27:15,265 INFO L704 BuchiCegarLoop]: Abstraction has 167 states and 182 transitions. [2022-02-21 03:27:15,265 INFO L587 BuchiCegarLoop]: Abstraction has 167 states and 182 transitions. [2022-02-21 03:27:15,265 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2022-02-21 03:27:15,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 182 transitions. [2022-02-21 03:27:15,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2022-02-21 03:27:15,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:15,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:15,267 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:27:15,267 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2022-02-21 03:27:15,267 INFO L791 eck$LassoCheckResult]: Stem: 10007#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10008#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 10014#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10012#L12 assume !(main_~i~0#1 >= 10); 10023#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 10020#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10021#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10066#L12 assume !(main_~i~0#1 >= 10); 10063#L12-2 assume !(main_~i~0#1 <= 0); 10062#L15-1 [2022-02-21 03:27:15,267 INFO L793 eck$LassoCheckResult]: Loop: 10062#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10061#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10060#L12 assume !(main_~i~0#1 >= 10); 10059#L12-2 assume !(main_~i~0#1 <= 0); 10058#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10057#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10056#L12 assume !(main_~i~0#1 >= 10); 10055#L12-2 assume !(main_~i~0#1 <= 0); 10054#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10053#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10052#L12 assume !(main_~i~0#1 >= 10); 10051#L12-2 assume !(main_~i~0#1 <= 0); 10050#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10049#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10048#L12 assume !(main_~i~0#1 >= 10); 10047#L12-2 assume !(main_~i~0#1 <= 0); 10046#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10045#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10044#L12 assume !(main_~i~0#1 >= 10); 10043#L12-2 assume !(main_~i~0#1 <= 0); 10042#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10041#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10040#L12 assume !(main_~i~0#1 >= 10); 10039#L12-2 assume !(main_~i~0#1 <= 0); 10038#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10037#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10036#L12 assume !(main_~i~0#1 >= 10); 10035#L12-2 assume !(main_~i~0#1 <= 0); 10034#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10033#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10032#L12 assume !(main_~i~0#1 >= 10); 10031#L12-2 assume !(main_~i~0#1 <= 0); 10030#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10029#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10026#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 10025#L12-2 assume !(main_~i~0#1 <= 0); 10006#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10013#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10027#L12 assume !(main_~i~0#1 >= 10); 10105#L12-2 assume !(main_~i~0#1 <= 0); 10104#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10103#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10102#L12 assume !(main_~i~0#1 >= 10); 10101#L12-2 assume !(main_~i~0#1 <= 0); 10100#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10099#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10098#L12 assume !(main_~i~0#1 >= 10); 10097#L12-2 assume !(main_~i~0#1 <= 0); 10096#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10095#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10094#L12 assume !(main_~i~0#1 >= 10); 10093#L12-2 assume !(main_~i~0#1 <= 0); 10092#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10091#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10090#L12 assume !(main_~i~0#1 >= 10); 10089#L12-2 assume !(main_~i~0#1 <= 0); 10088#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10087#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10086#L12 assume !(main_~i~0#1 >= 10); 10085#L12-2 assume !(main_~i~0#1 <= 0); 10084#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10083#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10082#L12 assume !(main_~i~0#1 >= 10); 10081#L12-2 assume !(main_~i~0#1 <= 0); 10080#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10079#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10078#L12 assume !(main_~i~0#1 >= 10); 10077#L12-2 assume !(main_~i~0#1 <= 0); 10076#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10075#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10074#L12 assume !(main_~i~0#1 >= 10); 10073#L12-2 assume !(main_~i~0#1 <= 0); 10072#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 10071#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10070#L12 assume !(main_~i~0#1 >= 10); 10069#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 10067#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 10068#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10064#L12 assume !(main_~i~0#1 >= 10); 10065#L12-2 assume !(main_~i~0#1 <= 0); 10062#L15-1 [2022-02-21 03:27:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 644068259, now seen corresponding path program 3 times [2022-02-21 03:27:15,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:15,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824977266] [2022-02-21 03:27:15,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:15,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:15,276 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:15,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1888138361, now seen corresponding path program 3 times [2022-02-21 03:27:15,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:15,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771354051] [2022-02-21 03:27:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:15,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:15,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:15,313 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1126640613, now seen corresponding path program 5 times [2022-02-21 03:27:15,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:15,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545329723] [2022-02-21 03:27:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:15,343 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:15,350 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:15,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:27:15 BoogieIcfgContainer [2022-02-21 03:27:15,849 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:27:15,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:27:15,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:27:15,850 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:27:15,850 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:27:05" (3/4) ... [2022-02-21 03:27:15,852 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 03:27:15,880 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:27:15,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:27:15,888 INFO L158 Benchmark]: Toolchain (without parser) took 11028.30ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 65.0MB in the beginning and 71.9MB in the end (delta: -6.9MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2022-02-21 03:27:15,888 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 53.9MB in the beginning and 53.8MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:27:15,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.52ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 64.8MB in the beginning and 93.5MB in the end (delta: -28.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:27:15,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.62ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:27:15,889 INFO L158 Benchmark]: Boogie Preprocessor took 13.23ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 91.4MB in the end (delta: 846.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:27:15,889 INFO L158 Benchmark]: RCFGBuilder took 223.30ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 82.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:27:15,889 INFO L158 Benchmark]: BuchiAutomizer took 10536.84ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 82.2MB in the beginning and 75.0MB in the end (delta: 7.2MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2022-02-21 03:27:15,889 INFO L158 Benchmark]: Witness Printer took 37.53ms. Allocated memory is still 172.0MB. Free memory was 75.0MB in the beginning and 71.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:27:15,890 INFO L339 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.15ms. Allocated memory is still 96.5MB. Free memory was 53.9MB in the beginning and 53.8MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.52ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 64.8MB in the beginning and 93.5MB in the end (delta: -28.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.62ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.23ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 91.4MB in the end (delta: 846.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 223.30ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 82.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10536.84ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 82.2MB in the beginning and 75.0MB in the end (delta: 7.2MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. * Witness Printer took 37.53ms. Allocated memory is still 172.0MB. Free memory was 75.0MB in the beginning and 71.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (8 trivial, 6 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 167 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.4s and 12 iterations. TraceHistogramMax:20. Analysis of lassos took 7.6s. Construction of modules took 0.3s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 245 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 168 states and ocurred in iteration 9. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 165 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 534 IncrementalHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 135 mSDtfsCounter, 534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc2 concLT1 SILN0 SILU0 SILI2 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax165 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf94 smp100 dnf100 smp100 tf110 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 18]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {i=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a70d784=0, up=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:27:15,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:16,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:16,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:16,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:16,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)