./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/recursive-simple/fibo_2calls_4-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:19:41,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:19:41,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:19:41,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:19:41,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:19:41,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:19:41,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:19:41,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:19:41,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:19:41,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:19:41,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:19:41,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:19:41,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:19:41,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:19:41,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:19:41,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:19:41,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:19:41,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:19:41,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:19:41,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:19:41,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:19:41,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:19:41,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:19:41,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:19:41,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:19:41,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:19:41,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:19:41,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:19:41,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:19:41,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:19:41,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:19:41,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:19:41,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:19:41,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:19:41,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:19:41,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:19:41,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:19:41,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:19:41,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:19:41,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:19:41,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:19:41,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:19:41,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:19:41,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:19:41,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:19:41,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:19:41,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:19:41,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:19:41,460 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:19:41,460 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:19:41,460 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:19:41,461 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:19:41,461 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:19:41,462 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:19:41,462 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:19:41,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:19:41,462 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:19:41,462 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:19:41,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:19:41,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:19:41,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:19:41,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:19:41,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:19:41,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:19:41,463 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:19:41,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:19:41,464 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:19:41,464 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:19:41,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:19:41,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:19:41,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:19:41,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:19:41,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:19:41,466 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:19:41,466 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 [2022-02-21 04:19:41,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:19:41,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:19:41,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:19:41,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:19:41,674 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:19:41,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2022-02-21 04:19:41,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464074ed6/5a8f2f7274d6401ca91e16302ca2a7a5/FLAGa957bbbeb [2022-02-21 04:19:42,080 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:19:42,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2022-02-21 04:19:42,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464074ed6/5a8f2f7274d6401ca91e16302ca2a7a5/FLAGa957bbbeb [2022-02-21 04:19:42,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464074ed6/5a8f2f7274d6401ca91e16302ca2a7a5 [2022-02-21 04:19:42,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:19:42,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:19:42,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:42,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:19:42,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:19:42,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7040b25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42, skipping insertion in model container [2022-02-21 04:19:42,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:19:42,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:19:42,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c[946,959] [2022-02-21 04:19:42,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:42,663 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:19:42,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c[946,959] [2022-02-21 04:19:42,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:42,682 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:19:42,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42 WrapperNode [2022-02-21 04:19:42,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:42,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:42,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:19:42,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:19:42,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,704 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 04:19:42,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:42,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:19:42,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:19:42,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:19:42,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:19:42,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:19:42,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:19:42,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:19:42,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (1/1) ... [2022-02-21 04:19:42,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:42,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:42,769 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 04:19:42,781 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 04:19:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:19:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:19:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-02-21 04:19:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-02-21 04:19:42,802 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-02-21 04:19:42,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-02-21 04:19:42,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:19:42,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:19:42,838 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:19:42,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:19:42,918 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:19:42,924 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:19:42,924 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 04:19:42,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:42 BoogieIcfgContainer [2022-02-21 04:19:42,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:19:42,926 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:19:42,926 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:19:42,928 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:19:42,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:42,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:19:42" (1/3) ... [2022-02-21 04:19:42,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d62089c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:42, skipping insertion in model container [2022-02-21 04:19:42,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:42,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:42" (2/3) ... [2022-02-21 04:19:42,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d62089c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:42, skipping insertion in model container [2022-02-21 04:19:42,931 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:42,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:42" (3/3) ... [2022-02-21 04:19:42,932 INFO L388 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_4-1.c [2022-02-21 04:19:42,962 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:19:42,962 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:19:42,962 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:19:42,962 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:19:42,962 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:19:42,963 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:19:42,963 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:19:42,963 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:19:42,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:43,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:43,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:43,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:43,015 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 04:19:43,015 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:43,015 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:19:43,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:43,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:43,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:43,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:43,025 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 04:19:43,025 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:43,030 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; 15#L39true call main_#t~ret8#1 := fibo1(main_~x~0#1);< 5#fibo1ENTRYtrue [2022-02-21 04:19:43,032 INFO L793 eck$LassoCheckResult]: Loop: 5#fibo1ENTRYtrue ~n := #in~n; 9#L10true assume !(~n < 1); 8#L12true assume !(1 == ~n); 10#L15true call #t~ret4 := fibo2(~n - 1);< 14#fibo2ENTRYtrue ~n := #in~n; 12#L20true assume !(~n < 1); 17#L22true assume !(1 == ~n); 23#L25true call #t~ret6 := fibo1(~n - 1);< 5#fibo1ENTRYtrue [2022-02-21 04:19:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash 29896, now seen corresponding path program 1 times [2022-02-21 04:19:43,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:43,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35490087] [2022-02-21 04:19:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:43,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:43,141 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 1 times [2022-02-21 04:19:43,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:43,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472615524] [2022-02-21 04:19:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:43,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:43,182 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:43,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1313669423, now seen corresponding path program 1 times [2022-02-21 04:19:43,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:43,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198886656] [2022-02-21 04:19:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:43,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:43,207 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:43,539 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:43,540 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:43,540 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:43,540 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:43,540 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:43,540 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:43,540 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:43,540 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:43,540 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration1_Loop [2022-02-21 04:19:43,540 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:43,541 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:43,554 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 04:19:43,561 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 04:19:43,564 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 04:19:43,568 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 04:19:43,570 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 04:19:43,572 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 04:19:43,576 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 04:19:43,580 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 04:19:43,582 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 04:19:43,591 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 04:19:43,688 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:43,688 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:43,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:43,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:43,701 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 04:19:43,702 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 04:19:43,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:43,703 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:43,729 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:43,729 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:43,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:19:43,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:43,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:43,756 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 04:19:43,757 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 04:19:43,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:43,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:43,775 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:43,775 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:43,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:43,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:43,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:43,809 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 04:19:43,810 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 04:19:43,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:43,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:43,819 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:43,819 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:43,836 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 04:19:43,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:43,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:43,838 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 04:19:43,839 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 04:19:43,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:43,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:43,851 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:43,851 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=0} Honda state: {fibo1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:43,868 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 04:19:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:43,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:43,870 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 04:19:43,871 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 04:19:43,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:43,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:43,887 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:43,888 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret6=0} Honda state: {fibo2_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:43,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 04:19:43,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:43,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:43,905 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 04:19:43,906 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 04:19:43,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:43,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:43,928 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:43,929 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:43,944 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 04:19:43,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:43,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:43,946 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 04:19:43,947 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 04:19:43,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:43,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:43,969 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:43,969 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:43,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:19:43,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:43,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:43,986 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 04:19:43,987 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 04:19:43,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:43,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:44,007 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:44,007 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:44,023 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 04:19:44,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,024 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 04:19:44,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:44,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:44,048 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 04:19:44,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 04:19:44,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,073 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 04:19:44,074 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 04:19:44,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:44,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:44,128 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:44,132 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 04:19:44,132 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:44,132 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:44,132 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:44,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:44,133 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:44,133 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,133 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:44,133 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:44,133 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration1_Loop [2022-02-21 04:19:44,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:44,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:44,134 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 04:19:44,136 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 04:19:44,139 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 04:19:44,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 04:19:44,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 04:19:44,151 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 04:19:44,154 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 04:19:44,163 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 04:19:44,166 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 04:19:44,168 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 04:19:44,236 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:44,239 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:44,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,241 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 04:19:44,242 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 04:19:44,243 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 04:19:44,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:44,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:44,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:44,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:44,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:44,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:44,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:44,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:44,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:44,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,284 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 04:19:44,285 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 04:19:44,287 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 04:19:44,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:44,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:44,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:44,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:44,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:44,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:44,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:44,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:44,326 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 04:19:44,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,328 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 04:19:44,329 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 04:19:44,330 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 04:19:44,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:44,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:44,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:44,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:44,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:44,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:44,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:44,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:44,386 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 04:19:44,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,388 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 04:19:44,389 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 04:19:44,390 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 04:19:44,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:44,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:44,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:44,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:44,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:44,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:44,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:44,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:44,428 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 04:19:44,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,430 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 04:19:44,430 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 04:19:44,437 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 04:19:44,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:44,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:44,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:44,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:44,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:44,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:44,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:44,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:44,479 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 04:19:44,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,480 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 04:19:44,481 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 04:19:44,483 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 04:19:44,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:44,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:44,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:44,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:44,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:44,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:44,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:44,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:44,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 04:19:44,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,516 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 04:19:44,517 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 04:19:44,519 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 04:19:44,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:44,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:44,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:44,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:44,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:44,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:44,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:44,546 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:44,549 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:44,549 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:44,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,552 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 04:19:44,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:44,596 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:44,596 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:44,597 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2022-02-21 04:19:44,611 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 04:19:44,614 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 04:19:44,619 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:44,623 INFO L390 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< [2022-02-21 04:19:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:44,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:19:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:44,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:44,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {36#unseeded} is VALID [2022-02-21 04:19:44,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {36#unseeded} is VALID [2022-02-21 04:19:44,684 INFO L272 TraceCheckUtils]: 2: Hoare triple {36#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {36#unseeded} is VALID [2022-02-21 04:19:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:44,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:44,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:44,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(>= oldRank0 |fibo1_#in~n|)} ~n := #in~n; {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:44,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(<= fibo1_~n oldRank0)} assume !(~n < 1); {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:44,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#(<= fibo1_~n oldRank0)} assume !(1 == ~n); {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:44,856 INFO L272 TraceCheckUtils]: 3: Hoare triple {60#(<= fibo1_~n oldRank0)} call #t~ret4 := fibo2(~n - 1); {70#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:44,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {74#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:19:44,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {74#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {78#(and (not (< fibo2_~n 1)) (<= (+ fibo2_~n 1) oldRank0))} is VALID [2022-02-21 04:19:44,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {78#(and (not (< fibo2_~n 1)) (<= (+ fibo2_~n 1) oldRank0))} assume !(1 == ~n); {78#(and (not (< fibo2_~n 1)) (<= (+ fibo2_~n 1) oldRank0))} is VALID [2022-02-21 04:19:44,858 INFO L272 TraceCheckUtils]: 7: Hoare triple {78#(and (not (< fibo2_~n 1)) (<= (+ fibo2_~n 1) oldRank0))} call #t~ret6 := fibo1(~n - 1); {49#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo1_#in~n|)))} is VALID [2022-02-21 04:19:44,858 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 04:19:44,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:44,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:44,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:44,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:44,893 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 04:19:44,894 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:45,157 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5). Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 116 transitions. Complement of second has 24 states. [2022-02-21 04:19:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:45,157 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:45,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:45,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:45,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:45,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:45,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:45,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:45,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:45,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:45,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 116 transitions. [2022-02-21 04:19:45,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:45,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:45,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:45,168 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:45,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:45,173 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:19:45,173 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:45,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:45,175 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:45,175 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 116 transitions. cyclomatic complexity: 34 [2022-02-21 04:19:45,181 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:19:45,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:45,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:45,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:45,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:45,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 84 letters. Loop has 84 letters. [2022-02-21 04:19:45,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 84 letters. [2022-02-21 04:19:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 84 letters. Loop has 84 letters. [2022-02-21 04:19:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:19:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:19:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:19:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:19:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:19:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:19:45,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:19:45,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:19:45,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 5 letters. Loop has 8 letters. [2022-02-21 04:19:45,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 8 letters. [2022-02-21 04:19:45,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 8 letters. [2022-02-21 04:19:45,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 4 letters. Loop has 8 letters. [2022-02-21 04:19:45,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 8 letters. [2022-02-21 04:19:45,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 8 letters. [2022-02-21 04:19:45,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 7 letters. Loop has 8 letters. [2022-02-21 04:19:45,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 8 letters. [2022-02-21 04:19:45,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 8 letters. [2022-02-21 04:19:45,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:45,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:45,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:45,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:45,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:45,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:45,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:45,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:45,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:45,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:19:45,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:19:45,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:19:45,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 6 letters. Loop has 8 letters. [2022-02-21 04:19:45,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 8 letters. [2022-02-21 04:19:45,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 8 letters. [2022-02-21 04:19:45,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:45,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:45,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:45,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:45,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:45,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:45,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:45,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:45,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:45,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:45,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:45,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:45,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:45,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:45,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:45,249 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 04:19:45,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:45,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:45,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:45,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 35 letters. Loop has 25 letters. [2022-02-21 04:19:45,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 25 letters. [2022-02-21 04:19:45,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 35 letters. Loop has 25 letters. [2022-02-21 04:19:45,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:45,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:45,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:45,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:19:45,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:45,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:19:45,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:45,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:45,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:45,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:45,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:45,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:45,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:45,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:45,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:45,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:45,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:45,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:45,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 49 letters. [2022-02-21 04:19:45,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 49 letters. [2022-02-21 04:19:45,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 49 letters. [2022-02-21 04:19:45,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 35 letters. Loop has 49 letters. [2022-02-21 04:19:45,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 49 letters. [2022-02-21 04:19:45,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 35 letters. Loop has 49 letters. [2022-02-21 04:19:45,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,263 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-02-21 04:19:45,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:45,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:19:45,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 16 letters. [2022-02-21 04:19:45,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:45,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. cyclomatic complexity: 34 [2022-02-21 04:19:45,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:45,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 82 transitions. [2022-02-21 04:19:45,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 04:19:45,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-02-21 04:19:45,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2022-02-21 04:19:45,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:45,285 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2022-02-21 04:19:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2022-02-21 04:19:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2022-02-21 04:19:45,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:45,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 82 transitions. Second operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 04:19:45,305 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 82 transitions. Second operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 04:19:45,306 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 04:19:45,308 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:45,316 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2022-02-21 04:19:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2022-02-21 04:19:45,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:45,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:45,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Second operand 61 states and 82 transitions. [2022-02-21 04:19:45,318 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Second operand 61 states and 82 transitions. [2022-02-21 04:19:45,319 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:45,327 INFO L93 Difference]: Finished difference Result 128 states and 169 transitions. [2022-02-21 04:19:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2022-02-21 04:19:45,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:45,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:45,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:45,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 04:19:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2022-02-21 04:19:45,332 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-02-21 04:19:45,332 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-02-21 04:19:45,333 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:19:45,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2022-02-21 04:19:45,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:45,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:45,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:45,334 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:45,334 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:45,335 INFO L791 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; 220#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 219#fibo1ENTRY ~n := #in~n; 221#L10 assume !(~n < 1); 232#L12 assume !(1 == ~n); 217#L15 call #t~ret4 := fibo2(~n - 1);< 237#fibo2ENTRY ~n := #in~n; 242#L20 assume !(~n < 1); 255#L22 assume !(1 == ~n); 210#L25 call #t~ret6 := fibo1(~n - 1);< 222#fibo1ENTRY ~n := #in~n; 224#L10 assume ~n < 1;#res := 0; 211#fibo1FINAL assume true; 212#fibo1EXIT >#46#return; 213#L25-1 [2022-02-21 04:19:45,335 INFO L793 eck$LassoCheckResult]: Loop: 213#L25-1 call #t~ret7 := fibo1(~n - 2);< 218#fibo1ENTRY ~n := #in~n; 246#L10 assume !(~n < 1); 247#L12 assume !(1 == ~n); 216#L15 call #t~ret4 := fibo2(~n - 1);< 249#fibo2ENTRY ~n := #in~n; 248#L20 assume !(~n < 1); 245#L22 assume !(1 == ~n); 225#L25 call #t~ret6 := fibo1(~n - 1);< 218#fibo1ENTRY ~n := #in~n; 246#L10 assume ~n < 1;#res := 0; 243#fibo1FINAL assume true; 244#fibo1EXIT >#46#return; 213#L25-1 [2022-02-21 04:19:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1888024054, now seen corresponding path program 1 times [2022-02-21 04:19:45,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:45,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811669664] [2022-02-21 04:19:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:19:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:45,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {743#true} ~n := #in~n; {751#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {752#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:45,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {752#(<= |fibo1_#in~n| 0)} assume true; {752#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:45,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {752#(<= |fibo1_#in~n| 0)} {746#(not (<= fibo2_~n 1))} #46#return; {744#false} is VALID [2022-02-21 04:19:45,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {743#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {743#true} is VALID [2022-02-21 04:19:45,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {743#true} is VALID [2022-02-21 04:19:45,422 INFO L272 TraceCheckUtils]: 2: Hoare triple {743#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {743#true} is VALID [2022-02-21 04:19:45,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {743#true} ~n := #in~n; {743#true} is VALID [2022-02-21 04:19:45,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {743#true} assume !(~n < 1); {743#true} is VALID [2022-02-21 04:19:45,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} assume !(1 == ~n); {743#true} is VALID [2022-02-21 04:19:45,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {743#true} call #t~ret4 := fibo2(~n - 1); {743#true} is VALID [2022-02-21 04:19:45,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {743#true} ~n := #in~n; {743#true} is VALID [2022-02-21 04:19:45,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {743#true} assume !(~n < 1); {745#(< 0 fibo2_~n)} is VALID [2022-02-21 04:19:45,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(< 0 fibo2_~n)} assume !(1 == ~n); {746#(not (<= fibo2_~n 1))} is VALID [2022-02-21 04:19:45,424 INFO L272 TraceCheckUtils]: 10: Hoare triple {746#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {743#true} is VALID [2022-02-21 04:19:45,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {743#true} ~n := #in~n; {751#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {751#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {752#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:45,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {752#(<= |fibo1_#in~n| 0)} assume true; {752#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:45,425 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {752#(<= |fibo1_#in~n| 0)} {746#(not (<= fibo2_~n 1))} #46#return; {744#false} is VALID [2022-02-21 04:19:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:19:45,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:45,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811669664] [2022-02-21 04:19:45,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811669664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:45,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:45,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:45,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964269847] [2022-02-21 04:19:45,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:45,428 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:45,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1730504828, now seen corresponding path program 1 times [2022-02-21 04:19:45,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:45,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752506192] [2022-02-21 04:19:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:45,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:19:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:45,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#true} ~n := #in~n; {761#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {761#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {762#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:45,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {762#(<= |fibo1_#in~n| 0)} assume true; {762#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:45,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {762#(<= |fibo1_#in~n| 0)} {756#(not (<= fibo2_~n 1))} #46#return; {754#false} is VALID [2022-02-21 04:19:45,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {753#true} call #t~ret7 := fibo1(~n - 2); {753#true} is VALID [2022-02-21 04:19:45,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} ~n := #in~n; {753#true} is VALID [2022-02-21 04:19:45,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#true} assume !(~n < 1); {753#true} is VALID [2022-02-21 04:19:45,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#true} assume !(1 == ~n); {753#true} is VALID [2022-02-21 04:19:45,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {753#true} call #t~ret4 := fibo2(~n - 1); {753#true} is VALID [2022-02-21 04:19:45,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#true} ~n := #in~n; {753#true} is VALID [2022-02-21 04:19:45,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {753#true} assume !(~n < 1); {755#(< 0 fibo2_~n)} is VALID [2022-02-21 04:19:45,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {755#(< 0 fibo2_~n)} assume !(1 == ~n); {756#(not (<= fibo2_~n 1))} is VALID [2022-02-21 04:19:45,502 INFO L272 TraceCheckUtils]: 8: Hoare triple {756#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {753#true} is VALID [2022-02-21 04:19:45,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#true} ~n := #in~n; {761#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {761#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {762#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:45,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {762#(<= |fibo1_#in~n| 0)} assume true; {762#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:45,504 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {762#(<= |fibo1_#in~n| 0)} {756#(not (<= fibo2_~n 1))} #46#return; {754#false} is VALID [2022-02-21 04:19:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:19:45,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:45,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752506192] [2022-02-21 04:19:45,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752506192] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:45,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:45,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:45,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039894434] [2022-02-21 04:19:45,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:45,505 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:19:45,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:45,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:19:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:19:45,508 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. cyclomatic complexity: 20 Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:45,648 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2022-02-21 04:19:45,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:19:45,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:45,660 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 04:19:45,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2022-02-21 04:19:45,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:45,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 86 transitions. [2022-02-21 04:19:45,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-02-21 04:19:45,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 04:19:45,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2022-02-21 04:19:45,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:45,668 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2022-02-21 04:19:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2022-02-21 04:19:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2022-02-21 04:19:45,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:45,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states and 86 transitions. Second operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 04:19:45,671 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states and 86 transitions. Second operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 04:19:45,672 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 04:19:45,672 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:45,679 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-02-21 04:19:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-02-21 04:19:45,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:45,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:45,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) Second operand 66 states and 86 transitions. [2022-02-21 04:19:45,681 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) Second operand 66 states and 86 transitions. [2022-02-21 04:19:45,681 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:45,688 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-02-21 04:19:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-02-21 04:19:45,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:45,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:45,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:45,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 04:19:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-02-21 04:19:45,692 INFO L704 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-21 04:19:45,692 INFO L587 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-21 04:19:45,692 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:19:45,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. [2022-02-21 04:19:45,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:45,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:45,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:45,693 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:45,693 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:45,694 INFO L791 eck$LassoCheckResult]: Stem: 833#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 834#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; 856#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 874#fibo1ENTRY ~n := #in~n; 886#L10 assume !(~n < 1); 885#L12 assume !(1 == ~n); 846#L15 call #t~ret4 := fibo2(~n - 1);< 868#fibo2ENTRY ~n := #in~n; 889#L20 assume !(~n < 1); 890#L22 assume !(1 == ~n); 841#L25 call #t~ret6 := fibo1(~n - 1);< 852#fibo1ENTRY ~n := #in~n; 853#L10 assume !(~n < 1); 878#L12 assume 1 == ~n;#res := 1; 877#fibo1FINAL assume true; 876#fibo1EXIT >#46#return; 843#L25-1 [2022-02-21 04:19:45,694 INFO L793 eck$LassoCheckResult]: Loop: 843#L25-1 call #t~ret7 := fibo1(~n - 2);< 850#fibo1ENTRY ~n := #in~n; 851#L10 assume !(~n < 1); 860#L12 assume !(1 == ~n); 849#L15 call #t~ret4 := fibo2(~n - 1);< 883#fibo2ENTRY ~n := #in~n; 881#L20 assume !(~n < 1); 879#L22 assume !(1 == ~n); 844#L25 call #t~ret6 := fibo1(~n - 1);< 850#fibo1ENTRY ~n := #in~n; 851#L10 assume !(~n < 1); 860#L12 assume 1 == ~n;#res := 1; 861#fibo1FINAL assume true; 875#fibo1EXIT >#46#return; 843#L25-1 [2022-02-21 04:19:45,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1600771562, now seen corresponding path program 1 times [2022-02-21 04:19:45,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:45,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62578095] [2022-02-21 04:19:45,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:45,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:19:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:45,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} ~n := #in~n; {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {1408#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {1408#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:45,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {1409#(<= |fibo1_#in~n| 1)} assume true; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:45,759 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 3 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:45,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1396#true} is VALID [2022-02-21 04:19:45,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1398#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:45,760 INFO L272 TraceCheckUtils]: 2: Hoare triple {1398#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1399#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {1399#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:45,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(~n < 1); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:45,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(1 == ~n); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:45,763 INFO L272 TraceCheckUtils]: 6: Hoare triple {1400#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1401#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:45,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#(<= 3 |fibo2_#in~n|)} ~n := #in~n; {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:45,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(~n < 1); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:45,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(1 == ~n); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:45,764 INFO L272 TraceCheckUtils]: 10: Hoare triple {1402#(<= 3 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1396#true} is VALID [2022-02-21 04:19:45,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {1408#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {1408#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:45,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {1409#(<= |fibo1_#in~n| 1)} assume true; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:45,767 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 3 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:45,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:45,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62578095] [2022-02-21 04:19:45,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62578095] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:45,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826092803] [2022-02-21 04:19:45,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:45,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:45,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,768 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:19:45,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 04:19:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:45,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:45,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:45,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1396#true} is VALID [2022-02-21 04:19:45,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1398#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:45,941 INFO L272 TraceCheckUtils]: 2: Hoare triple {1398#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1399#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:45,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {1399#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:45,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(~n < 1); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:45,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(1 == ~n); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:45,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {1400#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1401#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:45,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#(<= 3 |fibo2_#in~n|)} ~n := #in~n; {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:45,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(~n < 1); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:45,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(1 == ~n); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:45,945 INFO L272 TraceCheckUtils]: 10: Hoare triple {1402#(<= 3 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1396#true} is VALID [2022-02-21 04:19:45,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1446#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:45,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {1446#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1446#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:45,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {1446#(<= |fibo1_#in~n| fibo1_~n)} assume 1 == ~n;#res := 1; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:45,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {1409#(<= |fibo1_#in~n| 1)} assume true; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:45,947 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 3 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:45,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:46,245 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 3 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:46,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {1409#(<= |fibo1_#in~n| 1)} assume true; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:46,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {1468#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} assume 1 == ~n;#res := 1; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:46,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {1468#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} assume !(~n < 1); {1468#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:46,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1468#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:46,246 INFO L272 TraceCheckUtils]: 10: Hoare triple {1402#(<= 3 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1396#true} is VALID [2022-02-21 04:19:46,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(1 == ~n); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:46,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(~n < 1); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:46,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#(<= 3 |fibo2_#in~n|)} ~n := #in~n; {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:46,248 INFO L272 TraceCheckUtils]: 6: Hoare triple {1400#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1401#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:46,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(1 == ~n); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:46,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(~n < 1); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:46,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {1399#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:46,250 INFO L272 TraceCheckUtils]: 2: Hoare triple {1398#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1399#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:46,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1398#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:46,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1396#true} is VALID [2022-02-21 04:19:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:46,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826092803] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:46,251 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:46,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-02-21 04:19:46,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402958639] [2022-02-21 04:19:46,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:46,251 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2106067024, now seen corresponding path program 1 times [2022-02-21 04:19:46,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:46,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329256186] [2022-02-21 04:19:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:46,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:46,307 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:46,608 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:46,608 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:46,608 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:46,608 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:46,608 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:46,608 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:46,609 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:46,609 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:46,609 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration3_Loop [2022-02-21 04:19:46,609 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:46,609 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:46,610 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 04:19:46,624 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 04:19:46,626 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 04:19:46,627 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 04:19:46,629 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 04:19:46,631 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 04:19:46,633 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 04:19:46,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 04:19:46,641 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 04:19:46,753 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:46,753 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:46,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:46,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:46,761 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 04:19:46,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:46,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:46,794 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 04:19:46,797 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:46,798 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=0} Honda state: {fibo1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:46,815 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 04:19:46,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:46,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:46,817 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 04:19:46,818 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 04:19:46,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:46,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:46,826 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:46,826 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:46,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:46,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:46,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:46,849 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 04:19:46,850 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 04:19:46,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:46,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:46,858 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:46,858 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:46,876 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 04:19:46,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:46,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:46,877 INFO L229 MonitoredProcess]: Starting monitored process 24 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 04:19:46,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:19:46,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:46,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:46,910 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:46,910 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:46,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:46,961 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 04:19:46,963 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 04:19:46,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:46,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:46,984 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:46,984 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,002 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 04:19:47,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,003 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 04:19:47,004 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 04:19:47,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,028 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,028 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 04:19:47,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,045 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 04:19:47,046 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 04:19:47,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,069 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,069 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 04:19:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,087 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 04:19:47,089 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 04:19:47,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,122 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 04:19:47,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,124 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 04:19:47,125 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 04:19:47,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:47,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,007 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:48,010 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 04:19:48,011 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:48,011 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:48,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:48,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:48,011 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:48,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:48,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:48,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration3_Loop [2022-02-21 04:19:48,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:48,011 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:48,012 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 04:19:48,021 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 04:19:48,027 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 04:19:48,029 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 04:19:48,031 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 04:19:48,032 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 04:19:48,034 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 04:19:48,043 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 04:19:48,045 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 04:19:48,127 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:48,127 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:48,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,128 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 04:19:48,136 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 04:19:48,137 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 04:19:48,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,172 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 04:19:48,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,173 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 04:19:48,174 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 04:19:48,175 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 04:19:48,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,212 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 04:19:48,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,213 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 04:19:48,214 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 04:19:48,215 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 04:19:48,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:19:48,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,254 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 04:19:48,255 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 04:19:48,256 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 04:19:48,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:19:48,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,294 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 04:19:48,295 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 04:19:48,296 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 04:19:48,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,333 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 04:19:48,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,335 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 04:19:48,337 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 04:19:48,337 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 04:19:48,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 04:19:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,388 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 04:19:48,390 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 04:19:48,390 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 04:19:48,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:48,415 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:48,415 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:48,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,424 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 04:19:48,426 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 04:19:48,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:48,426 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:48,426 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:48,426 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2022-02-21 04:19:48,442 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 04:19:48,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:48,467 INFO L390 LassoCheck]: Loop: "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#46#return;" [2022-02-21 04:19:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:48,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {1504#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1504#unseeded} is VALID [2022-02-21 04:19:48,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {1504#unseeded} is VALID [2022-02-21 04:19:48,605 INFO L272 TraceCheckUtils]: 2: Hoare triple {1504#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1504#unseeded} is VALID [2022-02-21 04:19:48,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {1504#unseeded} ~n := #in~n; {1504#unseeded} is VALID [2022-02-21 04:19:48,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {1504#unseeded} assume !(~n < 1); {1504#unseeded} is VALID [2022-02-21 04:19:48,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#unseeded} assume !(1 == ~n); {1504#unseeded} is VALID [2022-02-21 04:19:48,607 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#unseeded} call #t~ret4 := fibo2(~n - 1); {1504#unseeded} is VALID [2022-02-21 04:19:48,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#unseeded} ~n := #in~n; {1504#unseeded} is VALID [2022-02-21 04:19:48,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#unseeded} assume !(~n < 1); {1504#unseeded} is VALID [2022-02-21 04:19:48,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#unseeded} assume !(1 == ~n); {1504#unseeded} is VALID [2022-02-21 04:19:48,608 INFO L272 TraceCheckUtils]: 10: Hoare triple {1504#unseeded} call #t~ret6 := fibo1(~n - 1); {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:48,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:48,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:48,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:48,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:48,610 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1552#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1504#unseeded} #46#return; {1504#unseeded} is VALID [2022-02-21 04:19:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:19:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:48,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {1507#(>= oldRank0 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {1568#(<= (+ 2 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:19:48,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {1568#(<= (+ 2 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {1572#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:19:48,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {1572#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:19:48,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {1572#(<= (+ fibo1_~n 2) oldRank0)} assume !(1 == ~n); {1572#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:19:48,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {1572#(<= (+ fibo1_~n 2) oldRank0)} call #t~ret4 := fibo2(~n - 1); {1582#(<= (+ 3 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:19:48,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {1582#(<= (+ 3 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {1586#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2022-02-21 04:19:48,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {1586#(<= (+ fibo2_~n 3) oldRank0)} assume !(~n < 1); {1586#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2022-02-21 04:19:48,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {1586#(<= (+ fibo2_~n 3) oldRank0)} assume !(1 == ~n); {1586#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2022-02-21 04:19:48,886 INFO L272 TraceCheckUtils]: 8: Hoare triple {1586#(<= (+ fibo2_~n 3) oldRank0)} call #t~ret6 := fibo1(~n - 1); {1596#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:19:48,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {1600#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:48,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {1600#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {1604#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:48,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {1604#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {1604#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:48,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {1604#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {1604#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:48,888 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1604#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} {1586#(<= (+ fibo2_~n 3) oldRank0)} #46#return; {1517#(or (and (>= oldRank0 0) (> oldRank0 fibo2_~n)) unseeded)} is VALID [2022-02-21 04:19:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:48,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:48,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:48,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:48,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,917 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 04:19:48,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20 Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:49,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:49,866 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 191 states and 263 transitions. Complement of second has 40 states. [2022-02-21 04:19:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:49,866 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:49,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. cyclomatic complexity: 20 [2022-02-21 04:19:49,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:49,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:49,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:49,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:19:49,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:49,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:49,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 263 transitions. [2022-02-21 04:19:49,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:49,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:49,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:49,875 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 76 transitions. cyclomatic complexity: 20 [2022-02-21 04:19:49,877 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 04:19:49,877 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:49,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:19:49,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:49,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 191 states and 263 transitions. cyclomatic complexity: 77 [2022-02-21 04:19:49,886 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:49,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:49,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:49,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:49,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:49,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:49,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:49,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:49,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:49,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:49,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 58 letters. Loop has 58 letters. [2022-02-21 04:19:49,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 58 letters. Loop has 58 letters. [2022-02-21 04:19:49,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 58 letters. Loop has 58 letters. [2022-02-21 04:19:49,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:19:49,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:19:49,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:19:49,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:49,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:49,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:49,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:49,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:49,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:49,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:49,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:49,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:49,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:49,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:49,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:49,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:49,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:49,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:49,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:49,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:49,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:49,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:49,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:49,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:49,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 8 letters. [2022-02-21 04:19:49,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 8 letters. [2022-02-21 04:19:49,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 8 letters. [2022-02-21 04:19:49,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:49,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:49,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:49,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:49,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:49,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:49,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:49,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:49,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:49,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:49,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:49,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:49,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:49,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:49,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:49,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:49,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:49,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:49,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 25 letters. Loop has 8 letters. [2022-02-21 04:19:49,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 8 letters. [2022-02-21 04:19:49,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 25 letters. Loop has 8 letters. [2022-02-21 04:19:49,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:49,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:49,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:49,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 27 letters. Loop has 8 letters. [2022-02-21 04:19:49,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 27 letters. Loop has 8 letters. [2022-02-21 04:19:49,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 27 letters. Loop has 8 letters. [2022-02-21 04:19:49,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:49,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:49,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:49,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:49,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:49,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:49,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 26 letters. Loop has 8 letters. [2022-02-21 04:19:49,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 8 letters. [2022-02-21 04:19:49,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 26 letters. Loop has 8 letters. [2022-02-21 04:19:49,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:49,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:49,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:49,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 28 letters. Loop has 8 letters. [2022-02-21 04:19:49,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 28 letters. Loop has 8 letters. [2022-02-21 04:19:49,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 28 letters. Loop has 8 letters. [2022-02-21 04:19:49,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:49,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:49,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:49,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:49,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:49,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:49,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:49,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:49,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:49,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:49,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:49,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:49,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 35 letters. Loop has 8 letters. [2022-02-21 04:19:49,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 35 letters. Loop has 8 letters. [2022-02-21 04:19:49,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 35 letters. Loop has 8 letters. [2022-02-21 04:19:49,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:49,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:49,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:49,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:49,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:49,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:49,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 34 letters. Loop has 8 letters. [2022-02-21 04:19:49,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 34 letters. Loop has 8 letters. [2022-02-21 04:19:49,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 34 letters. Loop has 8 letters. [2022-02-21 04:19:49,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:49,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:49,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:49,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:19:49,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:19:49,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:19:49,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:49,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:49,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:49,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 33 letters. Loop has 8 letters. [2022-02-21 04:19:49,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 33 letters. Loop has 8 letters. [2022-02-21 04:19:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 33 letters. Loop has 8 letters. [2022-02-21 04:19:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 41 letters. Loop has 13 letters. [2022-02-21 04:19:49,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 41 letters. Loop has 13 letters. [2022-02-21 04:19:49,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 41 letters. Loop has 13 letters. [2022-02-21 04:19:49,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:19:49,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:19:49,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:19:49,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:49,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:49,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:49,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,921 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-02-21 04:19:49,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:49,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 30 letters. Loop has 14 letters. [2022-02-21 04:19:49,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 16 letters. Loop has 28 letters. [2022-02-21 04:19:49,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 263 transitions. cyclomatic complexity: 77 [2022-02-21 04:19:49,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:49,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 169 states and 237 transitions. [2022-02-21 04:19:49,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2022-02-21 04:19:49,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2022-02-21 04:19:49,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 237 transitions. [2022-02-21 04:19:49,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:49,946 INFO L681 BuchiCegarLoop]: Abstraction has 169 states and 237 transitions. [2022-02-21 04:19:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 237 transitions. [2022-02-21 04:19:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2022-02-21 04:19:49,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:49,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states and 237 transitions. Second operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) [2022-02-21 04:19:49,954 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states and 237 transitions. Second operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) [2022-02-21 04:19:49,954 INFO L87 Difference]: Start difference. First operand 169 states and 237 transitions. Second operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) [2022-02-21 04:19:49,955 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:49,977 INFO L93 Difference]: Finished difference Result 364 states and 492 transitions. [2022-02-21 04:19:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2022-02-21 04:19:49,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:49,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:49,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) Second operand 169 states and 237 transitions. [2022-02-21 04:19:49,981 INFO L87 Difference]: Start difference. First operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) Second operand 169 states and 237 transitions. [2022-02-21 04:19:49,982 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:50,006 INFO L93 Difference]: Finished difference Result 390 states and 526 transitions. [2022-02-21 04:19:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 526 transitions. [2022-02-21 04:19:50,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:50,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:50,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:50,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) [2022-02-21 04:19:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2022-02-21 04:19:50,015 INFO L704 BuchiCegarLoop]: Abstraction has 152 states and 206 transitions. [2022-02-21 04:19:50,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:50,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 04:19:50,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-21 04:19:50,016 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:50,337 INFO L93 Difference]: Finished difference Result 183 states and 247 transitions. [2022-02-21 04:19:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:19:50,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:50,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:50,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 247 transitions. [2022-02-21 04:19:50,359 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:50,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 180 states and 243 transitions. [2022-02-21 04:19:50,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-02-21 04:19:50,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-02-21 04:19:50,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 243 transitions. [2022-02-21 04:19:50,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:50,366 INFO L681 BuchiCegarLoop]: Abstraction has 180 states and 243 transitions. [2022-02-21 04:19:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 243 transitions. [2022-02-21 04:19:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2022-02-21 04:19:50,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:50,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states and 243 transitions. Second operand has 165 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 111 states have internal predecessors, (129), 38 states have call successors, (40), 20 states have call predecessors, (40), 25 states have return successors, (56), 33 states have call predecessors, (56), 36 states have call successors, (56) [2022-02-21 04:19:50,373 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states and 243 transitions. Second operand has 165 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 111 states have internal predecessors, (129), 38 states have call successors, (40), 20 states have call predecessors, (40), 25 states have return successors, (56), 33 states have call predecessors, (56), 36 states have call successors, (56) [2022-02-21 04:19:50,373 INFO L87 Difference]: Start difference. First operand 180 states and 243 transitions. Second operand has 165 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 111 states have internal predecessors, (129), 38 states have call successors, (40), 20 states have call predecessors, (40), 25 states have return successors, (56), 33 states have call predecessors, (56), 36 states have call successors, (56) [2022-02-21 04:19:50,373 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:50,393 INFO L93 Difference]: Finished difference Result 401 states and 555 transitions. [2022-02-21 04:19:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 555 transitions. [2022-02-21 04:19:50,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:50,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:50,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 111 states have internal predecessors, (129), 38 states have call successors, (40), 20 states have call predecessors, (40), 25 states have return successors, (56), 33 states have call predecessors, (56), 36 states have call successors, (56) Second operand 180 states and 243 transitions. [2022-02-21 04:19:50,396 INFO L87 Difference]: Start difference. First operand has 165 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 111 states have internal predecessors, (129), 38 states have call successors, (40), 20 states have call predecessors, (40), 25 states have return successors, (56), 33 states have call predecessors, (56), 36 states have call successors, (56) Second operand 180 states and 243 transitions. [2022-02-21 04:19:50,396 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:50,414 INFO L93 Difference]: Finished difference Result 401 states and 555 transitions. [2022-02-21 04:19:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 555 transitions. [2022-02-21 04:19:50,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:50,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:50,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:50,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 111 states have internal predecessors, (129), 38 states have call successors, (40), 20 states have call predecessors, (40), 25 states have return successors, (56), 33 states have call predecessors, (56), 36 states have call successors, (56) [2022-02-21 04:19:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 225 transitions. [2022-02-21 04:19:50,421 INFO L704 BuchiCegarLoop]: Abstraction has 165 states and 225 transitions. [2022-02-21 04:19:50,421 INFO L587 BuchiCegarLoop]: Abstraction has 165 states and 225 transitions. [2022-02-21 04:19:50,421 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:19:50,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 225 transitions. [2022-02-21 04:19:50,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:50,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:50,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:50,423 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:50,423 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:50,423 INFO L791 eck$LassoCheckResult]: Stem: 3508#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 3509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; 3538#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 3579#fibo1ENTRY ~n := #in~n; 3565#L10 assume !(~n < 1); 3559#L12 assume !(1 == ~n); 3514#L15 call #t~ret4 := fibo2(~n - 1);< 3566#fibo2ENTRY ~n := #in~n; 3573#L20 assume !(~n < 1); 3513#L22 assume !(1 == ~n); 3515#L25 call #t~ret6 := fibo1(~n - 1);< 3546#fibo1ENTRY ~n := #in~n; 3609#L10 assume !(~n < 1); 3614#L12 assume !(1 == ~n); 3511#L15 call #t~ret4 := fibo2(~n - 1);< 3624#fibo2ENTRY ~n := #in~n; 3627#L20 assume ~n < 1;#res := 0; 3512#fibo2FINAL assume true; 3623#fibo2EXIT >#50#return; 3620#L15-1 call #t~ret5 := fibo2(~n - 2);< 3621#fibo2ENTRY ~n := #in~n; 3625#L20 assume ~n < 1;#res := 0; 3622#fibo2FINAL assume true; 3619#fibo2EXIT >#52#return; 3616#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3612#fibo1FINAL assume true; 3613#fibo1EXIT >#46#return; 3534#L25-1 call #t~ret7 := fibo1(~n - 2);< 3608#fibo1ENTRY ~n := #in~n; 3636#L10 assume ~n < 1;#res := 0; 3671#fibo1FINAL assume true; 3533#fibo1EXIT >#48#return; 3537#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 3549#fibo2FINAL assume true; 3560#fibo2EXIT >#50#return; 3540#L15-1 call #t~ret5 := fibo2(~n - 2);< 3547#fibo2ENTRY [2022-02-21 04:19:50,423 INFO L793 eck$LassoCheckResult]: Loop: 3547#fibo2ENTRY ~n := #in~n; 3576#L20 assume !(~n < 1); 3617#L22 assume !(1 == ~n); 3539#L25 call #t~ret6 := fibo1(~n - 1);< 3524#fibo1ENTRY ~n := #in~n; 3654#L10 assume !(~n < 1); 3556#L12 assume !(1 == ~n); 3542#L15 call #t~ret4 := fibo2(~n - 1);< 3547#fibo2ENTRY [2022-02-21 04:19:50,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash 613030308, now seen corresponding path program 1 times [2022-02-21 04:19:50,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:50,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681142330] [2022-02-21 04:19:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-21 04:19:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:50,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:50,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5119#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:50,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {5119#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {5120#(<= |fibo2_#in~n| 0)} assume true; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5120#(<= |fibo2_#in~n| 0)} {5110#(not (<= fibo1_~n 1))} #50#return; {5060#false} is VALID [2022-02-21 04:19:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:19:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:50,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:50,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:50,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5059#true} {5060#false} #52#return; {5060#false} is VALID [2022-02-21 04:19:50,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume !(~n < 1); {5109#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:50,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#(< 0 fibo1_~n)} assume !(1 == ~n); {5110#(not (<= fibo1_~n 1))} is VALID [2022-02-21 04:19:50,516 INFO L272 TraceCheckUtils]: 3: Hoare triple {5110#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {5059#true} is VALID [2022-02-21 04:19:50,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {5059#true} ~n := #in~n; {5119#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:50,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {5119#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {5120#(<= |fibo2_#in~n| 0)} assume true; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,517 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5120#(<= |fibo2_#in~n| 0)} {5110#(not (<= fibo1_~n 1))} #50#return; {5060#false} is VALID [2022-02-21 04:19:50,517 INFO L272 TraceCheckUtils]: 8: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5059#true} is VALID [2022-02-21 04:19:50,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:50,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:50,518 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5059#true} {5060#false} #52#return; {5060#false} is VALID [2022-02-21 04:19:50,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {5060#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5060#false} is VALID [2022-02-21 04:19:50,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:50,518 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5060#false} {5059#true} #46#return; {5060#false} is VALID [2022-02-21 04:19:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 04:19:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:50,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:50,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:50,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5059#true} {5060#false} #48#return; {5060#false} is VALID [2022-02-21 04:19:50,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume !(~n < 1); {5059#true} is VALID [2022-02-21 04:19:50,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {5059#true} assume !(1 == ~n); {5059#true} is VALID [2022-02-21 04:19:50,522 INFO L272 TraceCheckUtils]: 3: Hoare triple {5059#true} call #t~ret6 := fibo1(~n - 1); {5059#true} is VALID [2022-02-21 04:19:50,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {5059#true} assume !(~n < 1); {5109#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:50,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {5109#(< 0 fibo1_~n)} assume !(1 == ~n); {5110#(not (<= fibo1_~n 1))} is VALID [2022-02-21 04:19:50,523 INFO L272 TraceCheckUtils]: 7: Hoare triple {5110#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {5059#true} is VALID [2022-02-21 04:19:50,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {5059#true} ~n := #in~n; {5119#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:50,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {5119#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {5120#(<= |fibo2_#in~n| 0)} assume true; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,524 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5120#(<= |fibo2_#in~n| 0)} {5110#(not (<= fibo1_~n 1))} #50#return; {5060#false} is VALID [2022-02-21 04:19:50,524 INFO L272 TraceCheckUtils]: 12: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5059#true} is VALID [2022-02-21 04:19:50,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:50,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:50,525 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5059#true} {5060#false} #52#return; {5060#false} is VALID [2022-02-21 04:19:50,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {5060#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5060#false} is VALID [2022-02-21 04:19:50,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:50,525 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5060#false} {5059#true} #46#return; {5060#false} is VALID [2022-02-21 04:19:50,525 INFO L272 TraceCheckUtils]: 20: Hoare triple {5060#false} call #t~ret7 := fibo1(~n - 2); {5059#true} is VALID [2022-02-21 04:19:50,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:50,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:50,525 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5059#true} {5060#false} #48#return; {5060#false} is VALID [2022-02-21 04:19:50,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {5060#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5060#false} is VALID [2022-02-21 04:19:50,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:50,526 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5060#false} {5059#true} #50#return; {5060#false} is VALID [2022-02-21 04:19:50,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5059#true} is VALID [2022-02-21 04:19:50,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {5059#true} is VALID [2022-02-21 04:19:50,526 INFO L272 TraceCheckUtils]: 2: Hoare triple {5059#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5059#true} is VALID [2022-02-21 04:19:50,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {5059#true} assume !(~n < 1); {5059#true} is VALID [2022-02-21 04:19:50,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {5059#true} assume !(1 == ~n); {5059#true} is VALID [2022-02-21 04:19:50,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {5059#true} call #t~ret4 := fibo2(~n - 1); {5059#true} is VALID [2022-02-21 04:19:50,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {5059#true} assume !(~n < 1); {5059#true} is VALID [2022-02-21 04:19:50,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {5059#true} assume !(1 == ~n); {5059#true} is VALID [2022-02-21 04:19:50,527 INFO L272 TraceCheckUtils]: 10: Hoare triple {5059#true} call #t~ret6 := fibo1(~n - 1); {5059#true} is VALID [2022-02-21 04:19:50,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {5059#true} assume !(~n < 1); {5109#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:50,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {5109#(< 0 fibo1_~n)} assume !(1 == ~n); {5110#(not (<= fibo1_~n 1))} is VALID [2022-02-21 04:19:50,527 INFO L272 TraceCheckUtils]: 14: Hoare triple {5110#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {5059#true} is VALID [2022-02-21 04:19:50,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {5059#true} ~n := #in~n; {5119#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:50,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {5119#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {5120#(<= |fibo2_#in~n| 0)} assume true; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,529 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5120#(<= |fibo2_#in~n| 0)} {5110#(not (<= fibo1_~n 1))} #50#return; {5060#false} is VALID [2022-02-21 04:19:50,529 INFO L272 TraceCheckUtils]: 19: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5059#true} is VALID [2022-02-21 04:19:50,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:50,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:50,529 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5059#true} {5060#false} #52#return; {5060#false} is VALID [2022-02-21 04:19:50,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {5060#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5060#false} is VALID [2022-02-21 04:19:50,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:50,533 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5060#false} {5059#true} #46#return; {5060#false} is VALID [2022-02-21 04:19:50,533 INFO L272 TraceCheckUtils]: 27: Hoare triple {5060#false} call #t~ret7 := fibo1(~n - 2); {5059#true} is VALID [2022-02-21 04:19:50,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:50,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:50,534 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5059#true} {5060#false} #48#return; {5060#false} is VALID [2022-02-21 04:19:50,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {5060#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5060#false} is VALID [2022-02-21 04:19:50,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:50,534 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5060#false} {5059#true} #50#return; {5060#false} is VALID [2022-02-21 04:19:50,534 INFO L272 TraceCheckUtils]: 35: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5060#false} is VALID [2022-02-21 04:19:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 04:19:50,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:50,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681142330] [2022-02-21 04:19:50,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681142330] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:50,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219831201] [2022-02-21 04:19:50,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:50,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:50,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,552 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:19:50,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-02-21 04:19:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:50,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:19:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:50,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:50,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5059#true} is VALID [2022-02-21 04:19:50,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {5127#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:50,844 INFO L272 TraceCheckUtils]: 2: Hoare triple {5127#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5131#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:50,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {5131#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {5135#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:50,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {5135#(<= 4 fibo1_~n)} assume !(~n < 1); {5135#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:50,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {5135#(<= 4 fibo1_~n)} assume !(1 == ~n); {5135#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:50,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {5135#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5059#true} is VALID [2022-02-21 04:19:50,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {5059#true} ~n := #in~n; {5148#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:50,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {5148#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {5148#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:50,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {5148#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {5148#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:50,847 INFO L272 TraceCheckUtils]: 10: Hoare triple {5148#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {5059#true} is VALID [2022-02-21 04:19:50,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {5059#true} ~n := #in~n; {5161#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:50,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {5161#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {5161#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:50,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {5161#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {5161#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:50,847 INFO L272 TraceCheckUtils]: 14: Hoare triple {5161#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5059#true} is VALID [2022-02-21 04:19:50,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {5059#true} ~n := #in~n; {5148#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:50,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {5148#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {5120#(<= |fibo2_#in~n| 0)} assume true; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:50,849 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5120#(<= |fibo2_#in~n| 0)} {5161#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {5183#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:50,849 INFO L272 TraceCheckUtils]: 19: Hoare triple {5183#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {5059#true} is VALID [2022-02-21 04:19:50,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:50,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:50,850 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5059#true} {5183#(<= |fibo1_#in~n| 1)} #52#return; {5183#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:50,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {5183#(<= |fibo1_#in~n| 1)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5183#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:50,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {5183#(<= |fibo1_#in~n| 1)} assume true; {5183#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:50,853 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5183#(<= |fibo1_#in~n| 1)} {5148#(<= |fibo2_#in~n| fibo2_~n)} #46#return; {5208#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:50,853 INFO L272 TraceCheckUtils]: 27: Hoare triple {5208#(<= |fibo2_#in~n| 2)} call #t~ret7 := fibo1(~n - 2); {5059#true} is VALID [2022-02-21 04:19:50,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:50,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:50,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:50,855 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5059#true} {5208#(<= |fibo2_#in~n| 2)} #48#return; {5208#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:50,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {5208#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5208#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:50,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {5208#(<= |fibo2_#in~n| 2)} assume true; {5208#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:50,861 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5208#(<= |fibo2_#in~n| 2)} {5135#(<= 4 fibo1_~n)} #50#return; {5060#false} is VALID [2022-02-21 04:19:50,861 INFO L272 TraceCheckUtils]: 35: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5060#false} is VALID [2022-02-21 04:19:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 04:19:50,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:51,887 INFO L272 TraceCheckUtils]: 35: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5060#false} is VALID [2022-02-21 04:19:51,888 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5208#(<= |fibo2_#in~n| 2)} {5135#(<= 4 fibo1_~n)} #50#return; {5060#false} is VALID [2022-02-21 04:19:51,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {5208#(<= |fibo2_#in~n| 2)} assume true; {5208#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:51,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {5208#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5208#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:51,890 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5059#true} {5208#(<= |fibo2_#in~n| 2)} #48#return; {5208#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:51,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:51,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:51,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,890 INFO L272 TraceCheckUtils]: 27: Hoare triple {5208#(<= |fibo2_#in~n| 2)} call #t~ret7 := fibo1(~n - 2); {5059#true} is VALID [2022-02-21 04:19:51,891 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5183#(<= |fibo1_#in~n| 1)} {5266#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #46#return; {5208#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:51,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {5183#(<= |fibo1_#in~n| 1)} assume true; {5183#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:51,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {5183#(<= |fibo1_#in~n| 1)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5183#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:51,892 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5059#true} {5183#(<= |fibo1_#in~n| 1)} #52#return; {5183#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:51,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:51,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:51,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,892 INFO L272 TraceCheckUtils]: 19: Hoare triple {5183#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {5059#true} is VALID [2022-02-21 04:19:51,893 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5120#(<= |fibo2_#in~n| 0)} {5294#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} #50#return; {5183#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:51,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {5120#(<= |fibo2_#in~n| 0)} assume true; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:51,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {5304#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} assume ~n < 1;#res := 0; {5120#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:51,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {5059#true} ~n := #in~n; {5304#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} is VALID [2022-02-21 04:19:51,894 INFO L272 TraceCheckUtils]: 14: Hoare triple {5294#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {5059#true} is VALID [2022-02-21 04:19:51,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {5294#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(1 == ~n); {5294#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-21 04:19:51,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {5294#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(~n < 1); {5294#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-21 04:19:51,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {5059#true} ~n := #in~n; {5294#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-21 04:19:51,896 INFO L272 TraceCheckUtils]: 10: Hoare triple {5266#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret6 := fibo1(~n - 1); {5059#true} is VALID [2022-02-21 04:19:51,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {5266#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(1 == ~n); {5266#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:51,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {5266#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(~n < 1); {5266#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:51,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {5059#true} ~n := #in~n; {5266#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:51,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {5135#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5059#true} is VALID [2022-02-21 04:19:51,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {5135#(<= 4 fibo1_~n)} assume !(1 == ~n); {5135#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:51,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {5135#(<= 4 fibo1_~n)} assume !(~n < 1); {5135#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:51,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {5131#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {5135#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:51,899 INFO L272 TraceCheckUtils]: 2: Hoare triple {5127#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5131#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:51,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {5127#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:51,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5059#true} is VALID [2022-02-21 04:19:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 04:19:51,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219831201] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:51,901 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:51,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 16 [2022-02-21 04:19:51,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565896817] [2022-02-21 04:19:51,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:51,902 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:51,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 2 times [2022-02-21 04:19:51,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:51,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480865263] [2022-02-21 04:19:51,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:51,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:51,912 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:51,919 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:52,055 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:52,055 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:52,056 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:52,056 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:52,056 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:52,056 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,056 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:52,056 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:52,056 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration4_Loop [2022-02-21 04:19:52,056 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:52,056 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:52,058 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 04:19:52,059 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 04:19:52,061 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 04:19:52,063 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 04:19:52,068 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 04:19:52,070 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 04:19:52,072 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 04:19:52,074 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 04:19:52,076 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 04:19:52,077 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 04:19:52,158 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:52,158 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:52,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,160 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 04:19:52,161 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 04:19:52,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:52,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:52,183 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:52,183 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=0} Honda state: {fibo1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:52,198 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 04:19:52,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,200 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 04:19:52,201 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 04:19:52,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:52,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:52,223 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:52,223 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:52,240 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 04:19:52,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,242 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 04:19:52,242 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 04:19:52,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:52,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:52,265 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:52,265 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:52,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:52,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,281 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 04:19:52,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:52,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:52,300 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 04:19:52,325 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 04:19:52,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,326 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 04:19:52,327 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 04:19:52,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:52,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:52,390 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:52,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 04:19:52,394 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:52,394 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:52,394 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:52,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:52,394 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:52,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,394 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:52,394 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:52,394 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration4_Loop [2022-02-21 04:19:52,394 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:52,394 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:52,395 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 04:19:52,397 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 04:19:52,398 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 04:19:52,400 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 04:19:52,404 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 04:19:52,406 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 04:19:52,408 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 04:19:52,410 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 04:19:52,411 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 04:19:52,413 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 04:19:52,484 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:52,485 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:52,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,492 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 04:19:52,492 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 04:19:52,494 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 04:19:52,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:52,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:52,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:52,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:52,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:52,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:52,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:52,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:52,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 04:19:52,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,517 INFO L229 MonitoredProcess]: Starting monitored process 45 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 04:19:52,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 04:19:52,519 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 04:19:52,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:52,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:52,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:52,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:52,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:52,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:52,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:52,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:52,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 04:19:52,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,544 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 04:19:52,545 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 04:19:52,547 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 04:19:52,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:52,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:52,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:52,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:52,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:52,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:52,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:52,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:52,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 04:19:52,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,571 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 04:19:52,572 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 04:19:52,573 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 04:19:52,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:52,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:52,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:52,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:52,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:52,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:52,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:52,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:52,585 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:19:52,585 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:19:52,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,587 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 04:19:52,588 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 04:19:52,589 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:52,589 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:52,589 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:52,589 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2022-02-21 04:19:52,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 04:19:52,608 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:52,611 INFO L390 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< [2022-02-21 04:19:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:52,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:19:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:52,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:52,745 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 04:19:52,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {5343#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5343#unseeded} is VALID [2022-02-21 04:19:52,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {5343#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {5343#unseeded} is VALID [2022-02-21 04:19:52,974 INFO L272 TraceCheckUtils]: 2: Hoare triple {5343#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5343#unseeded} is VALID [2022-02-21 04:19:52,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#unseeded} ~n := #in~n; {5343#unseeded} is VALID [2022-02-21 04:19:52,975 INFO L290 TraceCheckUtils]: 4: Hoare triple {5343#unseeded} assume !(~n < 1); {5343#unseeded} is VALID [2022-02-21 04:19:52,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {5343#unseeded} assume !(1 == ~n); {5343#unseeded} is VALID [2022-02-21 04:19:52,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {5343#unseeded} call #t~ret4 := fibo2(~n - 1); {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,977 INFO L272 TraceCheckUtils]: 10: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,979 INFO L272 TraceCheckUtils]: 14: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,981 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,981 INFO L272 TraceCheckUtils]: 19: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,983 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,985 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,985 INFO L272 TraceCheckUtils]: 27: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,987 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,988 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5379#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5343#unseeded} #50#return; {5343#unseeded} is VALID [2022-02-21 04:19:52,989 INFO L272 TraceCheckUtils]: 35: Hoare triple {5343#unseeded} call #t~ret5 := fibo2(~n - 2); {5343#unseeded} is VALID [2022-02-21 04:19:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:52,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:53,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {5346#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {5467#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:53,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {5467#(<= fibo2_~n oldRank0)} assume !(~n < 1); {5467#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:53,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {5467#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {5467#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:53,095 INFO L272 TraceCheckUtils]: 3: Hoare triple {5467#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {5477#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:53,095 INFO L290 TraceCheckUtils]: 4: Hoare triple {5477#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {5481#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:19:53,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {5481#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {5485#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:53,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {5485#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:53,097 INFO L272 TraceCheckUtils]: 7: Hoare triple {5485#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {5356#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:19:53,097 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 04:19:53,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:53,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:53,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,132 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2022-02-21 04:19:53,132 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 225 transitions. cyclomatic complexity: 65 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:53,399 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 225 transitions. cyclomatic complexity: 65. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 671 states and 941 transitions. Complement of second has 26 states. [2022-02-21 04:19:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:53,399 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:53,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:53,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:53,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:53,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:53,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:53,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:53,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:53,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 941 transitions. [2022-02-21 04:19:53,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:53,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:53,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:53,405 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:53,410 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:53,410 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:53,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:53,411 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:53,411 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 671 states and 941 transitions. cyclomatic complexity: 286 [2022-02-21 04:19:53,416 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 36 examples of accepted words. [2022-02-21 04:19:53,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:53,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:53,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:53,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 671 letters. Loop has 671 letters. [2022-02-21 04:19:53,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 671 letters. Loop has 671 letters. [2022-02-21 04:19:53,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 671 letters. Loop has 671 letters. [2022-02-21 04:19:53,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:53,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:53,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:53,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:53,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:53,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:53,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:53,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:53,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:53,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:53,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:53,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:53,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:53,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:53,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:53,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:53,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:53,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:53,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:53,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:53,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:53,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:53,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:53,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:53,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:53,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:53,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:19:53,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:19:53,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:19:53,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:53,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:53,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:53,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:19:53,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:19:53,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:19:53,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:53,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:53,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:53,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:53,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:53,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:53,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:53,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:53,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:53,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:53,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:53,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:53,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:53,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:53,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:53,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:53,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:53,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:53,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:53,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:53,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:53,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 13 letters. [2022-02-21 04:19:53,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 13 letters. [2022-02-21 04:19:53,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 13 letters. [2022-02-21 04:19:53,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:53,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:53,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:53,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 25 letters. [2022-02-21 04:19:53,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 25 letters. [2022-02-21 04:19:53,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 60 letters. Loop has 25 letters. [2022-02-21 04:19:53,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:53,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:53,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:53,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:53,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:53,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:53,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:53,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:53,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:53,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:53,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:53,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:53,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:53,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:53,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:53,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:53,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:53,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:53,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,473 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 04:19:53,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,475 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:19:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:19:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:53,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {5343#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5343#unseeded} is VALID [2022-02-21 04:19:53,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {5343#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {5343#unseeded} is VALID [2022-02-21 04:19:53,822 INFO L272 TraceCheckUtils]: 2: Hoare triple {5343#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5343#unseeded} is VALID [2022-02-21 04:19:53,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#unseeded} ~n := #in~n; {5343#unseeded} is VALID [2022-02-21 04:19:53,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {5343#unseeded} assume !(~n < 1); {5343#unseeded} is VALID [2022-02-21 04:19:53,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {5343#unseeded} assume !(1 == ~n); {5343#unseeded} is VALID [2022-02-21 04:19:53,823 INFO L272 TraceCheckUtils]: 6: Hoare triple {5343#unseeded} call #t~ret4 := fibo2(~n - 1); {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,825 INFO L272 TraceCheckUtils]: 10: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,827 INFO L272 TraceCheckUtils]: 14: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,829 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,829 INFO L272 TraceCheckUtils]: 19: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,831 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,833 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,833 INFO L272 TraceCheckUtils]: 27: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,835 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:53,837 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6222#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5343#unseeded} #50#return; {5343#unseeded} is VALID [2022-02-21 04:19:53,837 INFO L272 TraceCheckUtils]: 35: Hoare triple {5343#unseeded} call #t~ret5 := fibo2(~n - 2); {5343#unseeded} is VALID [2022-02-21 04:19:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:53,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {5346#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {6310#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:53,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {6310#(<= fibo2_~n oldRank0)} assume !(~n < 1); {6310#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:53,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {6310#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {6310#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:53,961 INFO L272 TraceCheckUtils]: 3: Hoare triple {6310#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {6320#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:53,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {6320#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {6324#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:19:53,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {6324#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {6328#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:53,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {6328#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {6328#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:53,963 INFO L272 TraceCheckUtils]: 7: Hoare triple {6328#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {5356#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:19:53,963 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 04:19:53,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:53,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:53,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:53,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,997 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2022-02-21 04:19:53,997 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 225 transitions. cyclomatic complexity: 65 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:54,250 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 225 transitions. cyclomatic complexity: 65. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 671 states and 941 transitions. Complement of second has 26 states. [2022-02-21 04:19:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:54,250 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:54,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:54,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:54,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:54,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:54,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:54,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:54,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:54,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 941 transitions. [2022-02-21 04:19:54,255 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:54,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:54,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:54,256 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:54,256 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:54,256 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:54,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:54,257 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:54,257 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 671 states and 941 transitions. cyclomatic complexity: 286 [2022-02-21 04:19:54,262 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 36 examples of accepted words. [2022-02-21 04:19:54,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:54,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 671 letters. Loop has 671 letters. [2022-02-21 04:19:54,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 671 letters. Loop has 671 letters. [2022-02-21 04:19:54,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 671 letters. Loop has 671 letters. [2022-02-21 04:19:54,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:54,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:54,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:54,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:54,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:54,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:54,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:54,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:54,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:54,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:54,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:54,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:54,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:54,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:54,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:54,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:54,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:54,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:54,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:54,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:54,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:54,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:54,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:54,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:54,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:54,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:54,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:54,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:54,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:19:54,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:19:54,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:19:54,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:54,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:54,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:54,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:19:54,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:19:54,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:19:54,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:54,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:54,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:54,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:54,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:54,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:54,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:54,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:54,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:54,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:54,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:54,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:54,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:54,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:54,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:54,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:54,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:54,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:54,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:54,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:54,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:54,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:54,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:54,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:54,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:54,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:54,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:54,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:54,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:54,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:54,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 25 letters. [2022-02-21 04:19:54,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 25 letters. [2022-02-21 04:19:54,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 60 letters. Loop has 25 letters. [2022-02-21 04:19:54,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:54,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:54,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:54,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 49 letters. [2022-02-21 04:19:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 13 letters. [2022-02-21 04:19:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 13 letters. [2022-02-21 04:19:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 13 letters. [2022-02-21 04:19:54,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:54,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:54,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:54,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 671 states and 941 transitions. cyclomatic complexity: 286 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:19:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,307 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 04:19:54,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,309 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:19:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:19:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:54,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {5343#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5343#unseeded} is VALID [2022-02-21 04:19:54,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {5343#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {5343#unseeded} is VALID [2022-02-21 04:19:54,657 INFO L272 TraceCheckUtils]: 2: Hoare triple {5343#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5343#unseeded} is VALID [2022-02-21 04:19:54,657 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#unseeded} ~n := #in~n; {5343#unseeded} is VALID [2022-02-21 04:19:54,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {5343#unseeded} assume !(~n < 1); {5343#unseeded} is VALID [2022-02-21 04:19:54,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {5343#unseeded} assume !(1 == ~n); {5343#unseeded} is VALID [2022-02-21 04:19:54,659 INFO L272 TraceCheckUtils]: 6: Hoare triple {5343#unseeded} call #t~ret4 := fibo2(~n - 1); {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,660 INFO L272 TraceCheckUtils]: 10: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,662 INFO L272 TraceCheckUtils]: 14: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,664 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,665 INFO L272 TraceCheckUtils]: 19: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,667 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,668 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,669 INFO L272 TraceCheckUtils]: 27: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,682 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:54,683 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7065#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5343#unseeded} #50#return; {5343#unseeded} is VALID [2022-02-21 04:19:54,684 INFO L272 TraceCheckUtils]: 35: Hoare triple {5343#unseeded} call #t~ret5 := fibo2(~n - 2); {5343#unseeded} is VALID [2022-02-21 04:19:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:54,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {5346#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {7153#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:54,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {7153#(<= fibo2_~n oldRank0)} assume !(~n < 1); {7153#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:54,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {7153#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {7153#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:54,806 INFO L272 TraceCheckUtils]: 3: Hoare triple {7153#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {7163#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:54,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {7163#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {7167#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:19:54,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {7167#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {7171#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:54,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {7171#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {7171#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:54,808 INFO L272 TraceCheckUtils]: 7: Hoare triple {7171#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {5356#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:19:54,808 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 04:19:54,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:54,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:54,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,842 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2022-02-21 04:19:54,842 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 225 transitions. cyclomatic complexity: 65 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:55,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 225 transitions. cyclomatic complexity: 65. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 553 states and 762 transitions. Complement of second has 25 states. [2022-02-21 04:19:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:55,097 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:55,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:55,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:55,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:55,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:55,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:55,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:55,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:55,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 553 states and 762 transitions. [2022-02-21 04:19:55,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2022-02-21 04:19:55,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:55,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:55,101 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:55,102 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:55,102 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:55,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:55,102 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:55,103 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 553 states and 762 transitions. cyclomatic complexity: 217 [2022-02-21 04:19:55,111 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 40 examples of accepted words. [2022-02-21 04:19:55,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:55,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:55,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:55,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:55,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:55,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:55,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 13 letters. [2022-02-21 04:19:55,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 13 letters. [2022-02-21 04:19:55,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 36 letters. Loop has 13 letters. [2022-02-21 04:19:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 553 letters. Loop has 553 letters. [2022-02-21 04:19:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 553 letters. Loop has 553 letters. [2022-02-21 04:19:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 553 letters. Loop has 553 letters. [2022-02-21 04:19:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:55,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:55,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:55,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:55,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:55,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:55,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:55,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:55,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:55,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:55,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:55,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:55,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:55,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:55,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:55,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:55,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:55,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:55,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:55,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:55,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:55,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:55,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:55,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:55,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:55,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:55,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:55,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:55,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:55,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:19:55,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:55,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:55,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:19:55,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:55,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:55,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:55,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:55,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:55,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:55,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:55,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:55,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:55,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:55,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:55,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:55,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:55,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:55,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:55,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:55,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:55,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:55,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:55,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:55,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:19:55,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:55,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:55,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:55,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:55,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:55,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 61 letters. Loop has 25 letters. [2022-02-21 04:19:55,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:19:55,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:19:55,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:19:55,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:55,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:55,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 69 letters. Loop has 13 letters. [2022-02-21 04:19:55,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:19:55,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:19:55,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:19:55,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:55,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:55,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:55,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:55,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:55,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:19:55,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:55,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:55,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:55,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 45 letters. Loop has 61 letters. [2022-02-21 04:19:55,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 61 letters. [2022-02-21 04:19:55,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 45 letters. Loop has 61 letters. [2022-02-21 04:19:55,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:55,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:55,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:55,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:55,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:55,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:19:55,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 61 letters. [2022-02-21 04:19:55,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 61 letters. [2022-02-21 04:19:55,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 52 letters. Loop has 61 letters. [2022-02-21 04:19:55,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:55,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:55,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:19:55,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:55,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:55,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:19:55,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:55,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:55,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:55,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:55,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:55,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:55,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:19:55,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 178 letters. [2022-02-21 04:19:55,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 178 letters. [2022-02-21 04:19:55,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 52 letters. Loop has 178 letters. [2022-02-21 04:19:55,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 19 letters. [2022-02-21 04:19:55,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 19 letters. [2022-02-21 04:19:55,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 52 letters. Loop has 19 letters. [2022-02-21 04:19:55,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 167 letters. [2022-02-21 04:19:55,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 167 letters. [2022-02-21 04:19:55,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 52 letters. Loop has 167 letters. [2022-02-21 04:19:55,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 134 letters. [2022-02-21 04:19:55,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 134 letters. [2022-02-21 04:19:55,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 49 letters. Loop has 134 letters. [2022-02-21 04:19:55,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 161 letters. [2022-02-21 04:19:55,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 161 letters. [2022-02-21 04:19:55,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 52 letters. Loop has 161 letters. [2022-02-21 04:19:55,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:55,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:55,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 52 letters. Loop has 13 letters. [2022-02-21 04:19:55,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 126 letters. [2022-02-21 04:19:55,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 126 letters. [2022-02-21 04:19:55,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 49 letters. Loop has 126 letters. [2022-02-21 04:19:55,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:19:55,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:19:55,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:19:55,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:19:55,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:19:55,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:19:55,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:19:55,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:19:55,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:19:55,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:19:55,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:19:55,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:19:55,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:19:55,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:19:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:19:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:19:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:19:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:19:55,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 50 letters. [2022-02-21 04:19:55,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 50 letters. [2022-02-21 04:19:55,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 60 letters. Loop has 50 letters. [2022-02-21 04:19:55,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:19:55,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:19:55,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:19:55,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:19:55,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:19:55,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:19:55,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 32 letters. Loop has 13 letters. [2022-02-21 04:19:55,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 32 letters. Loop has 13 letters. [2022-02-21 04:19:55,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 32 letters. Loop has 13 letters. [2022-02-21 04:19:55,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 36 letters. Loop has 13 letters. [2022-02-21 04:19:55,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 36 letters. Loop has 13 letters. [2022-02-21 04:19:55,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 36 letters. Loop has 13 letters. [2022-02-21 04:19:55,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 90 letters. [2022-02-21 04:19:55,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 90 letters. [2022-02-21 04:19:55,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 60 letters. Loop has 90 letters. [2022-02-21 04:19:55,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 61 letters. [2022-02-21 04:19:55,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 61 letters. [2022-02-21 04:19:55,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 60 letters. Loop has 61 letters. [2022-02-21 04:19:55,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:55,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:55,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:19:55,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 32 letters. Loop has 175 letters. [2022-02-21 04:19:55,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 32 letters. Loop has 175 letters. [2022-02-21 04:19:55,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 32 letters. Loop has 175 letters. [2022-02-21 04:19:55,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 32 letters. Loop has 90 letters. [2022-02-21 04:19:55,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 32 letters. Loop has 90 letters. [2022-02-21 04:19:55,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 32 letters. Loop has 90 letters. [2022-02-21 04:19:55,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 32 letters. Loop has 111 letters. [2022-02-21 04:19:55,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 32 letters. Loop has 111 letters. [2022-02-21 04:19:55,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 32 letters. Loop has 111 letters. [2022-02-21 04:19:55,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 32 letters. Loop has 13 letters. [2022-02-21 04:19:55,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 32 letters. Loop has 13 letters. [2022-02-21 04:19:55,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 32 letters. Loop has 13 letters. [2022-02-21 04:19:55,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 60 letters. Loop has 98 letters. [2022-02-21 04:19:55,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 98 letters. [2022-02-21 04:19:55,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 60 letters. Loop has 98 letters. [2022-02-21 04:19:55,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 32 letters. Loop has 117 letters. [2022-02-21 04:19:55,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 32 letters. Loop has 117 letters. [2022-02-21 04:19:55,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 32 letters. Loop has 117 letters. [2022-02-21 04:19:55,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 225 transitions. cyclomatic complexity: 65 Stem has 32 letters. Loop has 19 letters. [2022-02-21 04:19:55,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 32 letters. Loop has 19 letters. [2022-02-21 04:19:55,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 762 transitions. cyclomatic complexity: 217 Stem has 32 letters. Loop has 19 letters. [2022-02-21 04:19:55,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,170 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-21 04:19:55,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:55,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:55,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 36 letters. Loop has 16 letters. [2022-02-21 04:19:55,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 553 states and 762 transitions. cyclomatic complexity: 217 [2022-02-21 04:19:55,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2022-02-21 04:19:55,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 553 states to 445 states and 639 transitions. [2022-02-21 04:19:55,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2022-02-21 04:19:55,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2022-02-21 04:19:55,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 445 states and 639 transitions. [2022-02-21 04:19:55,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:55,201 INFO L681 BuchiCegarLoop]: Abstraction has 445 states and 639 transitions. [2022-02-21 04:19:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states and 639 transitions. [2022-02-21 04:19:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 370. [2022-02-21 04:19:55,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:55,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 445 states and 639 transitions. Second operand has 370 states, 246 states have (on average 1.2845528455284554) internal successors, (316), 269 states have internal predecessors, (316), 71 states have call successors, (74), 55 states have call predecessors, (74), 53 states have return successors, (117), 45 states have call predecessors, (117), 69 states have call successors, (117) [2022-02-21 04:19:55,212 INFO L74 IsIncluded]: Start isIncluded. First operand 445 states and 639 transitions. Second operand has 370 states, 246 states have (on average 1.2845528455284554) internal successors, (316), 269 states have internal predecessors, (316), 71 states have call successors, (74), 55 states have call predecessors, (74), 53 states have return successors, (117), 45 states have call predecessors, (117), 69 states have call successors, (117) [2022-02-21 04:19:55,213 INFO L87 Difference]: Start difference. First operand 445 states and 639 transitions. Second operand has 370 states, 246 states have (on average 1.2845528455284554) internal successors, (316), 269 states have internal predecessors, (316), 71 states have call successors, (74), 55 states have call predecessors, (74), 53 states have return successors, (117), 45 states have call predecessors, (117), 69 states have call successors, (117) [2022-02-21 04:19:55,213 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:55,252 INFO L93 Difference]: Finished difference Result 840 states and 1183 transitions. [2022-02-21 04:19:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1183 transitions. [2022-02-21 04:19:55,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:55,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:55,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 370 states, 246 states have (on average 1.2845528455284554) internal successors, (316), 269 states have internal predecessors, (316), 71 states have call successors, (74), 55 states have call predecessors, (74), 53 states have return successors, (117), 45 states have call predecessors, (117), 69 states have call successors, (117) Second operand 445 states and 639 transitions. [2022-02-21 04:19:55,257 INFO L87 Difference]: Start difference. First operand has 370 states, 246 states have (on average 1.2845528455284554) internal successors, (316), 269 states have internal predecessors, (316), 71 states have call successors, (74), 55 states have call predecessors, (74), 53 states have return successors, (117), 45 states have call predecessors, (117), 69 states have call successors, (117) Second operand 445 states and 639 transitions. [2022-02-21 04:19:55,257 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:55,309 INFO L93 Difference]: Finished difference Result 1191 states and 1654 transitions. [2022-02-21 04:19:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1654 transitions. [2022-02-21 04:19:55,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:55,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:55,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:55,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 246 states have (on average 1.2845528455284554) internal successors, (316), 269 states have internal predecessors, (316), 71 states have call successors, (74), 55 states have call predecessors, (74), 53 states have return successors, (117), 45 states have call predecessors, (117), 69 states have call successors, (117) [2022-02-21 04:19:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 507 transitions. [2022-02-21 04:19:55,321 INFO L704 BuchiCegarLoop]: Abstraction has 370 states and 507 transitions. [2022-02-21 04:19:55,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:55,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:19:55,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:19:55,322 INFO L87 Difference]: Start difference. First operand 370 states and 507 transitions. Second operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 11 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (12), 3 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 04:19:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:55,973 INFO L93 Difference]: Finished difference Result 449 states and 635 transitions. [2022-02-21 04:19:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 04:19:55,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 11 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (12), 3 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 04:19:56,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:56,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 449 states and 635 transitions. [2022-02-21 04:19:56,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:19:56,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 449 states to 410 states and 591 transitions. [2022-02-21 04:19:56,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 228 [2022-02-21 04:19:56,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2022-02-21 04:19:56,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 410 states and 591 transitions. [2022-02-21 04:19:56,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:56,057 INFO L681 BuchiCegarLoop]: Abstraction has 410 states and 591 transitions. [2022-02-21 04:19:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states and 591 transitions. [2022-02-21 04:19:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 359. [2022-02-21 04:19:56,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:56,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states and 591 transitions. Second operand has 359 states, 233 states have (on average 1.240343347639485) internal successors, (289), 261 states have internal predecessors, (289), 74 states have call successors, (77), 50 states have call predecessors, (77), 52 states have return successors, (130), 47 states have call predecessors, (130), 72 states have call successors, (130) [2022-02-21 04:19:56,064 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states and 591 transitions. Second operand has 359 states, 233 states have (on average 1.240343347639485) internal successors, (289), 261 states have internal predecessors, (289), 74 states have call successors, (77), 50 states have call predecessors, (77), 52 states have return successors, (130), 47 states have call predecessors, (130), 72 states have call successors, (130) [2022-02-21 04:19:56,064 INFO L87 Difference]: Start difference. First operand 410 states and 591 transitions. Second operand has 359 states, 233 states have (on average 1.240343347639485) internal successors, (289), 261 states have internal predecessors, (289), 74 states have call successors, (77), 50 states have call predecessors, (77), 52 states have return successors, (130), 47 states have call predecessors, (130), 72 states have call successors, (130) [2022-02-21 04:19:56,065 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:56,103 INFO L93 Difference]: Finished difference Result 1003 states and 1442 transitions. [2022-02-21 04:19:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1442 transitions. [2022-02-21 04:19:56,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:56,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:56,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 233 states have (on average 1.240343347639485) internal successors, (289), 261 states have internal predecessors, (289), 74 states have call successors, (77), 50 states have call predecessors, (77), 52 states have return successors, (130), 47 states have call predecessors, (130), 72 states have call successors, (130) Second operand 410 states and 591 transitions. [2022-02-21 04:19:56,108 INFO L87 Difference]: Start difference. First operand has 359 states, 233 states have (on average 1.240343347639485) internal successors, (289), 261 states have internal predecessors, (289), 74 states have call successors, (77), 50 states have call predecessors, (77), 52 states have return successors, (130), 47 states have call predecessors, (130), 72 states have call successors, (130) Second operand 410 states and 591 transitions. [2022-02-21 04:19:56,108 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:56,154 INFO L93 Difference]: Finished difference Result 1012 states and 1457 transitions. [2022-02-21 04:19:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1457 transitions. [2022-02-21 04:19:56,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:56,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:56,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:56,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 233 states have (on average 1.240343347639485) internal successors, (289), 261 states have internal predecessors, (289), 74 states have call successors, (77), 50 states have call predecessors, (77), 52 states have return successors, (130), 47 states have call predecessors, (130), 72 states have call successors, (130) [2022-02-21 04:19:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 496 transitions. [2022-02-21 04:19:56,166 INFO L704 BuchiCegarLoop]: Abstraction has 359 states and 496 transitions. [2022-02-21 04:19:56,166 INFO L587 BuchiCegarLoop]: Abstraction has 359 states and 496 transitions. [2022-02-21 04:19:56,166 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:19:56,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 359 states and 496 transitions. [2022-02-21 04:19:56,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:19:56,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:56,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:56,170 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:56,170 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1] [2022-02-21 04:19:56,170 INFO L791 eck$LassoCheckResult]: Stem: 11801#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 11802#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; 11837#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 11881#fibo1ENTRY ~n := #in~n; 11929#L10 assume !(~n < 1); 11928#L12 assume !(1 == ~n); 11913#L15 call #t~ret4 := fibo2(~n - 1);< 11926#fibo2ENTRY ~n := #in~n; 11925#L20 assume !(~n < 1); 11922#L22 assume !(1 == ~n); 11843#L25 call #t~ret6 := fibo1(~n - 1);< 11914#fibo1ENTRY ~n := #in~n; 11923#L10 assume !(~n < 1); 12019#L12 assume !(1 == ~n); 11998#L15 call #t~ret4 := fibo2(~n - 1);< 12017#fibo2ENTRY ~n := #in~n; 12022#L20 assume !(~n < 1); 12021#L22 assume 1 == ~n;#res := 1; 12018#fibo2FINAL assume true; 12016#fibo2EXIT >#50#return; 11840#L15-1 call #t~ret5 := fibo2(~n - 2);< 11844#fibo2ENTRY ~n := #in~n; 12044#L20 assume ~n < 1;#res := 0; 12033#fibo2FINAL assume true; 12032#fibo2EXIT >#52#return; 12031#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12030#fibo1FINAL assume true; 12029#fibo1EXIT >#46#return; 12004#L25-1 call #t~ret7 := fibo1(~n - 2);< 12010#fibo1ENTRY ~n := #in~n; 12150#L10 assume ~n < 1;#res := 0; 12148#fibo1FINAL assume true; 12054#fibo1EXIT >#48#return; 12055#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 12077#fibo2FINAL assume true; 12076#fibo2EXIT >#50#return; 11811#L15-1 call #t~ret5 := fibo2(~n - 2);< 11999#fibo2ENTRY [2022-02-21 04:19:56,171 INFO L793 eck$LassoCheckResult]: Loop: 11999#fibo2ENTRY ~n := #in~n; 11879#L20 assume !(~n < 1); 11809#L22 assume !(1 == ~n); 11815#L25 call #t~ret6 := fibo1(~n - 1);< 12013#fibo1ENTRY ~n := #in~n; 12027#L10 assume !(~n < 1); 12072#L12 assume !(1 == ~n); 11810#L15 call #t~ret4 := fibo2(~n - 1);< 11878#fibo2ENTRY ~n := #in~n; 11879#L20 assume !(~n < 1); 11809#L22 assume !(1 == ~n); 11815#L25 call #t~ret6 := fibo1(~n - 1);< 12013#fibo1ENTRY ~n := #in~n; 12027#L10 assume !(~n < 1); 12072#L12 assume !(1 == ~n); 11810#L15 call #t~ret4 := fibo2(~n - 1);< 11878#fibo2ENTRY ~n := #in~n; 11880#L20 assume !(~n < 1); 12091#L22 assume 1 == ~n;#res := 1; 12090#fibo2FINAL assume true; 12087#fibo2EXIT >#50#return; 11812#L15-1 call #t~ret5 := fibo2(~n - 2);< 11999#fibo2ENTRY ~n := #in~n; 12000#L20 assume ~n < 1;#res := 0; 12100#fibo2FINAL assume true; 12086#fibo2EXIT >#52#return; 12039#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12085#fibo1FINAL assume true; 12080#fibo1EXIT >#46#return; 12081#L25-1 call #t~ret7 := fibo1(~n - 2);< 12067#fibo1ENTRY ~n := #in~n; 12094#L10 assume !(~n < 1); 12093#L12 assume !(1 == ~n); 12037#L15 call #t~ret4 := fibo2(~n - 1);< 12047#fibo2ENTRY ~n := #in~n; 12070#L20 assume !(~n < 1); 12068#L22 assume !(1 == ~n); 12066#L25 call #t~ret6 := fibo1(~n - 1);< 12067#fibo1ENTRY ~n := #in~n; 12094#L10 assume !(~n < 1); 12093#L12 assume !(1 == ~n); 12037#L15 call #t~ret4 := fibo2(~n - 1);< 12047#fibo2ENTRY ~n := #in~n; 12070#L20 assume !(~n < 1); 12068#L22 assume 1 == ~n;#res := 1; 12069#fibo2FINAL assume true; 12088#fibo2EXIT >#50#return; 11812#L15-1 call #t~ret5 := fibo2(~n - 2);< 11999#fibo2ENTRY ~n := #in~n; 12000#L20 assume ~n < 1;#res := 0; 12100#fibo2FINAL assume true; 12086#fibo2EXIT >#52#return; 12039#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12085#fibo1FINAL assume true; 12080#fibo1EXIT >#46#return; 12081#L25-1 call #t~ret7 := fibo1(~n - 2);< 12067#fibo1ENTRY ~n := #in~n; 12094#L10 assume ~n < 1;#res := 0; 12053#fibo1FINAL assume true; 12084#fibo1EXIT >#48#return; 12083#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 12046#fibo2FINAL assume true; 12036#fibo2EXIT >#50#return; 11812#L15-1 call #t~ret5 := fibo2(~n - 2);< 11999#fibo2ENTRY ~n := #in~n; 12000#L20 assume ~n < 1;#res := 0; 12100#fibo2FINAL assume true; 12086#fibo2EXIT >#52#return; 12039#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12085#fibo1FINAL assume true; 12080#fibo1EXIT >#48#return; 12083#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 12046#fibo2FINAL assume true; 12036#fibo2EXIT >#50#return; 11812#L15-1 call #t~ret5 := fibo2(~n - 2);< 11999#fibo2ENTRY [2022-02-21 04:19:56,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1718474001, now seen corresponding path program 1 times [2022-02-21 04:19:56,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:56,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716225764] [2022-02-21 04:19:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-21 04:19:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:56,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,258 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15365#true} {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:19:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:56,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15365#true} {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {15421#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15422#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:19:56,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {15422#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,263 INFO L272 TraceCheckUtils]: 3: Hoare triple {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:56,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,264 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15365#true} {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,265 INFO L272 TraceCheckUtils]: 9: Hoare triple {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {15365#true} is VALID [2022-02-21 04:19:56,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:56,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,266 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15365#true} {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {15433#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {15433#(<= 2 |fibo1_#in~n|)} assume true; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,267 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15433#(<= 2 |fibo1_#in~n|)} {15365#true} #46#return; {15416#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:19:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {15421#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {15434#(<= |fibo1_#in~n| 0)} assume true; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15434#(<= |fibo1_#in~n| 0)} {15416#(<= 3 fibo2_~n)} #48#return; {15366#false} is VALID [2022-02-21 04:19:56,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {15365#true} assume !(1 == ~n); {15365#true} is VALID [2022-02-21 04:19:56,281 INFO L272 TraceCheckUtils]: 3: Hoare triple {15365#true} call #t~ret6 := fibo1(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {15421#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15422#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:19:56,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {15422#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,282 INFO L272 TraceCheckUtils]: 7: Hoare triple {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:56,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,283 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15365#true} {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,283 INFO L272 TraceCheckUtils]: 13: Hoare triple {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {15365#true} is VALID [2022-02-21 04:19:56,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:56,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,284 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15365#true} {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {15433#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {15433#(<= 2 |fibo1_#in~n|)} assume true; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,285 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15433#(<= 2 |fibo1_#in~n|)} {15365#true} #46#return; {15416#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:56,285 INFO L272 TraceCheckUtils]: 21: Hoare triple {15416#(<= 3 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {15365#true} is VALID [2022-02-21 04:19:56,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {15421#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {15434#(<= |fibo1_#in~n| 0)} assume true; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,287 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15434#(<= |fibo1_#in~n| 0)} {15416#(<= 3 fibo2_~n)} #48#return; {15366#false} is VALID [2022-02-21 04:19:56,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {15366#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15366#false} is VALID [2022-02-21 04:19:56,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {15366#false} assume true; {15366#false} is VALID [2022-02-21 04:19:56,287 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15366#false} {15369#(<= 4 fibo1_~n)} #50#return; {15366#false} is VALID [2022-02-21 04:19:56,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15365#true} is VALID [2022-02-21 04:19:56,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {15365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {15367#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:56,288 INFO L272 TraceCheckUtils]: 2: Hoare triple {15367#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {15368#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {15368#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:56,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(~n < 1); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:56,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(1 == ~n); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:56,289 INFO L272 TraceCheckUtils]: 6: Hoare triple {15369#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#true} assume !(1 == ~n); {15365#true} is VALID [2022-02-21 04:19:56,290 INFO L272 TraceCheckUtils]: 10: Hoare triple {15365#true} call #t~ret6 := fibo1(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {15421#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15422#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:19:56,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {15422#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,291 INFO L272 TraceCheckUtils]: 14: Hoare triple {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:56,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,292 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {15365#true} {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,292 INFO L272 TraceCheckUtils]: 20: Hoare triple {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {15365#true} is VALID [2022-02-21 04:19:56,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:56,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,293 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15365#true} {15423#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {15433#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {15433#(<= 2 |fibo1_#in~n|)} assume true; {15433#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,294 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15433#(<= 2 |fibo1_#in~n|)} {15365#true} #46#return; {15416#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:56,294 INFO L272 TraceCheckUtils]: 28: Hoare triple {15416#(<= 3 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {15365#true} is VALID [2022-02-21 04:19:56,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {15421#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {15434#(<= |fibo1_#in~n| 0)} assume true; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,296 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15434#(<= |fibo1_#in~n| 0)} {15416#(<= 3 fibo2_~n)} #48#return; {15366#false} is VALID [2022-02-21 04:19:56,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {15366#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15366#false} is VALID [2022-02-21 04:19:56,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {15366#false} assume true; {15366#false} is VALID [2022-02-21 04:19:56,296 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15366#false} {15369#(<= 4 fibo1_~n)} #50#return; {15366#false} is VALID [2022-02-21 04:19:56,296 INFO L272 TraceCheckUtils]: 36: Hoare triple {15366#false} call #t~ret5 := fibo2(~n - 2); {15366#false} is VALID [2022-02-21 04:19:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 04:19:56,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:56,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716225764] [2022-02-21 04:19:56,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716225764] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:56,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860550740] [2022-02-21 04:19:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:56,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:56,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:56,298 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:19:56,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-02-21 04:19:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:56,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15365#true} is VALID [2022-02-21 04:19:56,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {15365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {15367#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:56,517 INFO L272 TraceCheckUtils]: 2: Hoare triple {15367#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {15368#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {15368#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:56,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(~n < 1); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:56,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(1 == ~n); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:56,519 INFO L272 TraceCheckUtils]: 6: Hoare triple {15369#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {15365#true} ~n := #in~n; {15459#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:56,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {15459#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {15459#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:56,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {15459#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {15459#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:56,520 INFO L272 TraceCheckUtils]: 10: Hoare triple {15459#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {15365#true} assume !(1 == ~n); {15365#true} is VALID [2022-02-21 04:19:56,520 INFO L272 TraceCheckUtils]: 14: Hoare triple {15365#true} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:56,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,521 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {15365#true} {15365#true} #50#return; {15365#true} is VALID [2022-02-21 04:19:56,521 INFO L272 TraceCheckUtils]: 20: Hoare triple {15365#true} call #t~ret5 := fibo2(~n - 2); {15365#true} is VALID [2022-02-21 04:19:56,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:56,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,521 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15365#true} {15365#true} #52#return; {15365#true} is VALID [2022-02-21 04:19:56,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {15365#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15365#true} is VALID [2022-02-21 04:19:56,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,522 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15365#true} {15459#(<= |fibo2_#in~n| fibo2_~n)} #46#return; {15459#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:56,522 INFO L272 TraceCheckUtils]: 28: Hoare triple {15459#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {15365#true} is VALID [2022-02-21 04:19:56,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {15365#true} ~n := #in~n; {15526#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:56,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {15526#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {15434#(<= |fibo1_#in~n| 0)} assume true; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,524 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15434#(<= |fibo1_#in~n| 0)} {15459#(<= |fibo2_#in~n| fibo2_~n)} #48#return; {15536#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:56,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {15536#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15536#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:56,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {15536#(<= |fibo2_#in~n| 2)} assume true; {15536#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:56,526 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15536#(<= |fibo2_#in~n| 2)} {15369#(<= 4 fibo1_~n)} #50#return; {15366#false} is VALID [2022-02-21 04:19:56,526 INFO L272 TraceCheckUtils]: 36: Hoare triple {15366#false} call #t~ret5 := fibo2(~n - 2); {15366#false} is VALID [2022-02-21 04:19:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 04:19:56,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:56,986 INFO L272 TraceCheckUtils]: 36: Hoare triple {15366#false} call #t~ret5 := fibo2(~n - 2); {15366#false} is VALID [2022-02-21 04:19:56,986 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15536#(<= |fibo2_#in~n| 2)} {15369#(<= 4 fibo1_~n)} #50#return; {15366#false} is VALID [2022-02-21 04:19:56,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {15536#(<= |fibo2_#in~n| 2)} assume true; {15536#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:56,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {15536#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15536#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:56,988 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15434#(<= |fibo1_#in~n| 0)} {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #48#return; {15536#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:56,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {15434#(<= |fibo1_#in~n| 0)} assume true; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {15574#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} assume ~n < 1;#res := 0; {15434#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:56,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {15365#true} ~n := #in~n; {15574#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,989 INFO L272 TraceCheckUtils]: 28: Hoare triple {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret7 := fibo1(~n - 2); {15365#true} is VALID [2022-02-21 04:19:56,989 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15365#true} {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #46#return; {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:56,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {15365#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15365#true} is VALID [2022-02-21 04:19:56,989 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15365#true} {15365#true} #52#return; {15365#true} is VALID [2022-02-21 04:19:56,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L272 TraceCheckUtils]: 20: Hoare triple {15365#true} call #t~ret5 := fibo2(~n - 2); {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {15365#true} {15365#true} #50#return; {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L272 TraceCheckUtils]: 14: Hoare triple {15365#true} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {15365#true} assume !(1 == ~n); {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:56,990 INFO L272 TraceCheckUtils]: 10: Hoare triple {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret6 := fibo1(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(1 == ~n); {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:56,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(~n < 1); {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:56,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {15365#true} ~n := #in~n; {15564#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:56,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {15369#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:56,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(1 == ~n); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:56,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(~n < 1); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:56,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {15368#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:56,993 INFO L272 TraceCheckUtils]: 2: Hoare triple {15367#(<= 4 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {15368#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:56,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {15365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {15367#(<= 4 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:56,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15365#true} is VALID [2022-02-21 04:19:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 04:19:56,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860550740] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:56,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:56,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-02-21 04:19:56,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188654868] [2022-02-21 04:19:56,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:56,994 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 688787707, now seen corresponding path program 1 times [2022-02-21 04:19:56,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:56,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954582842] [2022-02-21 04:19:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 04:19:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {15795#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {15795#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,070 INFO L290 TraceCheckUtils]: 3: Hoare triple {15796#(<= |fibo2_#in~n| 1)} assume true; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,071 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15796#(<= |fibo2_#in~n| 1)} {15783#(= fibo1_~n |fibo1_#in~n|)} #50#return; {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:19:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:19:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15656#true} {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,077 INFO L272 TraceCheckUtils]: 3: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {15795#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {15795#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {15796#(<= |fibo2_#in~n| 1)} assume true; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,079 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15796#(<= |fibo2_#in~n| 1)} {15783#(= fibo1_~n |fibo1_#in~n|)} #50#return; {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:19:57,079 INFO L272 TraceCheckUtils]: 9: Hoare triple {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,080 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15656#true} {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {15794#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {15794#(<= |fibo1_#in~n| 2)} assume true; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,081 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15794#(<= |fibo1_#in~n| 2)} {15656#true} #46#return; {15741#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:19:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:57,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,130 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:19:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:57,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,134 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:57,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,134 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:57,134 INFO L272 TraceCheckUtils]: 9: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,135 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:57,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {15656#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15656#true} is VALID [2022-02-21 04:19:57,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,135 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:19:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:57,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,139 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,139 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,139 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:57,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,140 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:57,140 INFO L272 TraceCheckUtils]: 13: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,140 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:57,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {15656#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15656#true} is VALID [2022-02-21 04:19:57,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,141 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:57,141 INFO L272 TraceCheckUtils]: 21: Hoare triple {15656#true} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,141 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:57,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {15656#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15656#true} is VALID [2022-02-21 04:19:57,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,142 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15656#true} {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 04:19:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15656#true} {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15797#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:19:57,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {15797#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,147 INFO L272 TraceCheckUtils]: 3: Hoare triple {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,148 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,148 INFO L272 TraceCheckUtils]: 11: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:57,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,149 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:57,149 INFO L272 TraceCheckUtils]: 17: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,149 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:57,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15656#true} is VALID [2022-02-21 04:19:57,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,150 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:57,150 INFO L272 TraceCheckUtils]: 25: Hoare triple {15656#true} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,150 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:57,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {15656#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15656#true} is VALID [2022-02-21 04:19:57,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,151 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15656#true} {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,151 INFO L272 TraceCheckUtils]: 33: Hoare triple {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,152 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15656#true} {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} assume true; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,153 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15832#(<= 2 |fibo1_#in~n|)} {15741#(<= fibo2_~n 3)} #48#return; {15657#false} is VALID [2022-02-21 04:19:57,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,154 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,155 INFO L272 TraceCheckUtils]: 7: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {15795#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {15795#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {15796#(<= |fibo2_#in~n| 1)} assume true; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,157 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15796#(<= |fibo2_#in~n| 1)} {15783#(= fibo1_~n |fibo1_#in~n|)} #50#return; {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:19:57,157 INFO L272 TraceCheckUtils]: 13: Hoare triple {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,158 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15656#true} {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {15794#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {15794#(<= |fibo1_#in~n| 2)} assume true; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,159 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15794#(<= |fibo1_#in~n| 2)} {15656#true} #46#return; {15741#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:57,159 INFO L272 TraceCheckUtils]: 21: Hoare triple {15741#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15797#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:19:57,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {15797#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,160 INFO L272 TraceCheckUtils]: 25: Hoare triple {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,161 INFO L272 TraceCheckUtils]: 29: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,161 INFO L272 TraceCheckUtils]: 33: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:57,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,162 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:57,162 INFO L272 TraceCheckUtils]: 39: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,162 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:57,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {15656#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15656#true} is VALID [2022-02-21 04:19:57,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,163 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:57,163 INFO L272 TraceCheckUtils]: 47: Hoare triple {15656#true} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,163 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:57,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {15656#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15656#true} is VALID [2022-02-21 04:19:57,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,164 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15656#true} {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,164 INFO L272 TraceCheckUtils]: 55: Hoare triple {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,164 INFO L290 TraceCheckUtils]: 58: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,165 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15656#true} {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,165 INFO L290 TraceCheckUtils]: 60: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} assume true; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,166 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15832#(<= 2 |fibo1_#in~n|)} {15741#(<= fibo2_~n 3)} #48#return; {15657#false} is VALID [2022-02-21 04:19:57,166 INFO L290 TraceCheckUtils]: 63: Hoare triple {15657#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15657#false} is VALID [2022-02-21 04:19:57,166 INFO L290 TraceCheckUtils]: 64: Hoare triple {15657#false} assume true; {15657#false} is VALID [2022-02-21 04:19:57,166 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {15657#false} {15656#true} #50#return; {15657#false} is VALID [2022-02-21 04:19:57,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,167 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,168 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,168 INFO L272 TraceCheckUtils]: 11: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,169 INFO L272 TraceCheckUtils]: 15: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {15656#true} ~n := #in~n; {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {15795#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {15795#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {15796#(<= |fibo2_#in~n| 1)} assume true; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,171 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15796#(<= |fibo2_#in~n| 1)} {15783#(= fibo1_~n |fibo1_#in~n|)} #50#return; {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:19:57,171 INFO L272 TraceCheckUtils]: 21: Hoare triple {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,172 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15656#true} {15789#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {15794#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {15794#(<= |fibo1_#in~n| 2)} assume true; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,173 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15794#(<= |fibo1_#in~n| 2)} {15656#true} #46#return; {15741#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:57,173 INFO L272 TraceCheckUtils]: 29: Hoare triple {15741#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {15783#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15797#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:19:57,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {15797#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,174 INFO L272 TraceCheckUtils]: 33: Hoare triple {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,175 INFO L272 TraceCheckUtils]: 37: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,175 INFO L272 TraceCheckUtils]: 41: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:57,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,176 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:57,176 INFO L272 TraceCheckUtils]: 47: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,176 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:57,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {15656#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15656#true} is VALID [2022-02-21 04:19:57,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,176 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:57,177 INFO L272 TraceCheckUtils]: 55: Hoare triple {15656#true} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,177 INFO L290 TraceCheckUtils]: 57: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,177 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:57,177 INFO L290 TraceCheckUtils]: 60: Hoare triple {15656#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15656#true} is VALID [2022-02-21 04:19:57,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,178 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15656#true} {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,178 INFO L272 TraceCheckUtils]: 63: Hoare triple {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,178 INFO L290 TraceCheckUtils]: 64: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,179 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15656#true} {15798#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,179 INFO L290 TraceCheckUtils]: 68: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} assume true; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,180 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {15832#(<= 2 |fibo1_#in~n|)} {15741#(<= fibo2_~n 3)} #48#return; {15657#false} is VALID [2022-02-21 04:19:57,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {15657#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15657#false} is VALID [2022-02-21 04:19:57,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {15657#false} assume true; {15657#false} is VALID [2022-02-21 04:19:57,180 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15657#false} {15656#true} #50#return; {15657#false} is VALID [2022-02-21 04:19:57,180 INFO L272 TraceCheckUtils]: 74: Hoare triple {15657#false} call #t~ret5 := fibo2(~n - 2); {15657#false} is VALID [2022-02-21 04:19:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 34 proven. 36 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-02-21 04:19:57,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:57,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954582842] [2022-02-21 04:19:57,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954582842] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:57,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074774428] [2022-02-21 04:19:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:57,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:57,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:57,183 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 04:19:57,184 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 04:19:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:19:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:57,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,546 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,547 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,547 INFO L272 TraceCheckUtils]: 11: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} ~n := #in~n; {15902#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:57,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {15902#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {15902#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:57,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {15902#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {15902#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:57,548 INFO L272 TraceCheckUtils]: 15: Hoare triple {15902#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {15656#true} ~n := #in~n; {15915#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:57,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {15915#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {15915#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:57,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {15915#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {15796#(<= |fibo2_#in~n| 1)} assume true; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:57,550 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15796#(<= |fibo2_#in~n| 1)} {15902#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,550 INFO L272 TraceCheckUtils]: 21: Hoare triple {15794#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,551 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15656#true} {15794#(<= |fibo1_#in~n| 2)} #52#return; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {15794#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {15794#(<= |fibo1_#in~n| 2)} assume true; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:57,552 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15794#(<= |fibo1_#in~n| 2)} {15656#true} #46#return; {15741#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:57,552 INFO L272 TraceCheckUtils]: 29: Hoare triple {15741#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {15656#true} ~n := #in~n; {15958#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {15958#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {15958#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {15958#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {15958#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,553 INFO L272 TraceCheckUtils]: 33: Hoare triple {15958#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {15656#true} ~n := #in~n; {15971#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {15971#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,554 INFO L272 TraceCheckUtils]: 37: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:57,555 INFO L272 TraceCheckUtils]: 41: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:57,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,555 INFO L290 TraceCheckUtils]: 43: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:57,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:57,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,555 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:57,555 INFO L272 TraceCheckUtils]: 47: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,556 INFO L290 TraceCheckUtils]: 48: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,556 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:57,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {15656#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15656#true} is VALID [2022-02-21 04:19:57,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,557 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15656#true} {15975#(<= 1 |fibo2_#in~n|)} #46#return; {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,557 INFO L272 TraceCheckUtils]: 55: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,557 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15656#true} {15975#(<= 1 |fibo2_#in~n|)} #48#return; {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} assume true; {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:57,559 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15975#(<= 1 |fibo2_#in~n|)} {15958#(<= fibo1_~n |fibo1_#in~n|)} #50#return; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,559 INFO L272 TraceCheckUtils]: 63: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:57,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:57,559 INFO L290 TraceCheckUtils]: 65: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:57,559 INFO L290 TraceCheckUtils]: 66: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:57,560 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15656#true} {15832#(<= 2 |fibo1_#in~n|)} #52#return; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,560 INFO L290 TraceCheckUtils]: 68: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,560 INFO L290 TraceCheckUtils]: 69: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} assume true; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,561 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {15832#(<= 2 |fibo1_#in~n|)} {15741#(<= fibo2_~n 3)} #48#return; {15657#false} is VALID [2022-02-21 04:19:57,561 INFO L290 TraceCheckUtils]: 71: Hoare triple {15657#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15657#false} is VALID [2022-02-21 04:19:57,561 INFO L290 TraceCheckUtils]: 72: Hoare triple {15657#false} assume true; {15657#false} is VALID [2022-02-21 04:19:57,561 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15657#false} {15656#true} #50#return; {15657#false} is VALID [2022-02-21 04:19:57,561 INFO L272 TraceCheckUtils]: 74: Hoare triple {15657#false} call #t~ret5 := fibo2(~n - 2); {15657#false} is VALID [2022-02-21 04:19:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-02-21 04:19:57,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:58,709 INFO L272 TraceCheckUtils]: 74: Hoare triple {15657#false} call #t~ret5 := fibo2(~n - 2); {15657#false} is VALID [2022-02-21 04:19:58,709 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15657#false} {15656#true} #50#return; {15657#false} is VALID [2022-02-21 04:19:58,709 INFO L290 TraceCheckUtils]: 72: Hoare triple {15657#false} assume true; {15657#false} is VALID [2022-02-21 04:19:58,709 INFO L290 TraceCheckUtils]: 71: Hoare triple {15657#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15657#false} is VALID [2022-02-21 04:19:58,710 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {15832#(<= 2 |fibo1_#in~n|)} {15741#(<= fibo2_~n 3)} #48#return; {15657#false} is VALID [2022-02-21 04:19:58,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} assume true; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,711 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15656#true} {15832#(<= 2 |fibo1_#in~n|)} #52#return; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,711 INFO L290 TraceCheckUtils]: 66: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,711 INFO L290 TraceCheckUtils]: 65: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,711 INFO L290 TraceCheckUtils]: 64: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,711 INFO L272 TraceCheckUtils]: 63: Hoare triple {15832#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,712 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15975#(<= 1 |fibo2_#in~n|)} {16135#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} #50#return; {15832#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,712 INFO L290 TraceCheckUtils]: 61: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} assume true; {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,713 INFO L290 TraceCheckUtils]: 60: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,713 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15656#true} {15975#(<= 1 |fibo2_#in~n|)} #48#return; {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,713 INFO L272 TraceCheckUtils]: 55: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15656#true} {15975#(<= 1 |fibo2_#in~n|)} #46#return; {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {15656#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L272 TraceCheckUtils]: 47: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:58,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,715 INFO L272 TraceCheckUtils]: 41: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,715 INFO L272 TraceCheckUtils]: 37: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {15975#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {16220#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {15975#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {15656#true} ~n := #in~n; {16220#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-21 04:19:58,728 INFO L272 TraceCheckUtils]: 33: Hoare triple {16135#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {16135#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(1 == ~n); {16135#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:19:58,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {16135#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(~n < 1); {16135#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:19:58,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {15656#true} ~n := #in~n; {16135#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:19:58,729 INFO L272 TraceCheckUtils]: 29: Hoare triple {15741#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,730 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15794#(<= |fibo1_#in~n| 2)} {15656#true} #46#return; {15741#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:58,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {15794#(<= |fibo1_#in~n| 2)} assume true; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:58,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {15794#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:58,731 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15656#true} {15794#(<= |fibo1_#in~n| 2)} #52#return; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:58,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,731 INFO L272 TraceCheckUtils]: 21: Hoare triple {15794#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,731 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15796#(<= |fibo2_#in~n| 1)} {16263#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} #50#return; {15794#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:58,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {15796#(<= |fibo2_#in~n| 1)} assume true; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:58,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {16273#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume 1 == ~n;#res := 1; {15796#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:19:58,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {16273#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {16273#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:19:58,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {15656#true} ~n := #in~n; {16273#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:19:58,733 INFO L272 TraceCheckUtils]: 15: Hoare triple {16263#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {16263#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(1 == ~n); {16263#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:19:58,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {16263#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(~n < 1); {16263#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:19:58,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} ~n := #in~n; {16263#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:19:58,734 INFO L272 TraceCheckUtils]: 11: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-02-21 04:19:58,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074774428] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:58,736 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:58,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-02-21 04:19:58,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646152306] [2022-02-21 04:19:58,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:58,737 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:19:58,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:19:58,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:19:58,738 INFO L87 Difference]: Start difference. First operand 359 states and 496 transitions. cyclomatic complexity: 144 Second operand has 16 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 04:19:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:59,120 INFO L93 Difference]: Finished difference Result 387 states and 546 transitions. [2022-02-21 04:19:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 04:19:59,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 04:19:59,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:59,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 546 transitions. [2022-02-21 04:19:59,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:19:59,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 387 states and 546 transitions. [2022-02-21 04:19:59,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2022-02-21 04:19:59,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2022-02-21 04:19:59,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 546 transitions. [2022-02-21 04:19:59,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:59,186 INFO L681 BuchiCegarLoop]: Abstraction has 387 states and 546 transitions. [2022-02-21 04:19:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 546 transitions. [2022-02-21 04:19:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 369. [2022-02-21 04:19:59,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:59,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states and 546 transitions. Second operand has 369 states, 238 states have (on average 1.2352941176470589) internal successors, (294), 269 states have internal predecessors, (294), 75 states have call successors, (78), 50 states have call predecessors, (78), 56 states have return successors, (136), 49 states have call predecessors, (136), 73 states have call successors, (136) [2022-02-21 04:19:59,195 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states and 546 transitions. Second operand has 369 states, 238 states have (on average 1.2352941176470589) internal successors, (294), 269 states have internal predecessors, (294), 75 states have call successors, (78), 50 states have call predecessors, (78), 56 states have return successors, (136), 49 states have call predecessors, (136), 73 states have call successors, (136) [2022-02-21 04:19:59,196 INFO L87 Difference]: Start difference. First operand 387 states and 546 transitions. Second operand has 369 states, 238 states have (on average 1.2352941176470589) internal successors, (294), 269 states have internal predecessors, (294), 75 states have call successors, (78), 50 states have call predecessors, (78), 56 states have return successors, (136), 49 states have call predecessors, (136), 73 states have call successors, (136) [2022-02-21 04:19:59,196 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:59,231 INFO L93 Difference]: Finished difference Result 965 states and 1340 transitions. [2022-02-21 04:19:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1340 transitions. [2022-02-21 04:19:59,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:59,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:59,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 369 states, 238 states have (on average 1.2352941176470589) internal successors, (294), 269 states have internal predecessors, (294), 75 states have call successors, (78), 50 states have call predecessors, (78), 56 states have return successors, (136), 49 states have call predecessors, (136), 73 states have call successors, (136) Second operand 387 states and 546 transitions. [2022-02-21 04:19:59,236 INFO L87 Difference]: Start difference. First operand has 369 states, 238 states have (on average 1.2352941176470589) internal successors, (294), 269 states have internal predecessors, (294), 75 states have call successors, (78), 50 states have call predecessors, (78), 56 states have return successors, (136), 49 states have call predecessors, (136), 73 states have call successors, (136) Second operand 387 states and 546 transitions. [2022-02-21 04:19:59,236 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:59,272 INFO L93 Difference]: Finished difference Result 965 states and 1340 transitions. [2022-02-21 04:19:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1340 transitions. [2022-02-21 04:19:59,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:59,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:59,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:59,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 238 states have (on average 1.2352941176470589) internal successors, (294), 269 states have internal predecessors, (294), 75 states have call successors, (78), 50 states have call predecessors, (78), 56 states have return successors, (136), 49 states have call predecessors, (136), 73 states have call successors, (136) [2022-02-21 04:19:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 508 transitions. [2022-02-21 04:19:59,283 INFO L704 BuchiCegarLoop]: Abstraction has 369 states and 508 transitions. [2022-02-21 04:19:59,283 INFO L587 BuchiCegarLoop]: Abstraction has 369 states and 508 transitions. [2022-02-21 04:19:59,283 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:19:59,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 508 transitions. [2022-02-21 04:19:59,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:19:59,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:59,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:59,286 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:59,286 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:59,286 INFO L791 eck$LassoCheckResult]: Stem: 16714#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 16715#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; 16749#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 16803#fibo1ENTRY ~n := #in~n; 16851#L10 assume !(~n < 1); 16850#L12 assume !(1 == ~n); 16842#L15 call #t~ret4 := fibo2(~n - 1);< 16848#fibo2ENTRY ~n := #in~n; 16847#L20 assume !(~n < 1); 16844#L22 assume !(1 == ~n); 16772#L25 call #t~ret6 := fibo1(~n - 1);< 16843#fibo1ENTRY ~n := #in~n; 16832#L10 assume !(~n < 1); 16833#L12 assume !(1 == ~n); 16819#L15 call #t~ret4 := fibo2(~n - 1);< 16820#fibo2ENTRY ~n := #in~n; 16834#L20 assume !(~n < 1); 16835#L22 assume !(1 == ~n); 16774#L25 call #t~ret6 := fibo1(~n - 1);< 16843#fibo1ENTRY ~n := #in~n; 16845#L10 assume !(~n < 1); 16937#L12 assume 1 == ~n;#res := 1; 16933#fibo1FINAL assume true; 16929#fibo1EXIT >#46#return; 16930#L25-1 call #t~ret7 := fibo1(~n - 2);< 16922#fibo1ENTRY ~n := #in~n; 17007#L10 assume ~n < 1;#res := 0; 17008#fibo1FINAL assume true; 17036#fibo1EXIT >#48#return; 17003#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 17032#fibo2FINAL assume true; 16950#fibo2EXIT >#50#return; 16790#L15-1 [2022-02-21 04:19:59,287 INFO L793 eck$LassoCheckResult]: Loop: 16790#L15-1 call #t~ret5 := fibo2(~n - 2);< 16770#fibo2ENTRY ~n := #in~n; 16789#L20 assume !(~n < 1); 16794#L22 assume !(1 == ~n); 16744#L25 call #t~ret6 := fibo1(~n - 1);< 16927#fibo1ENTRY ~n := #in~n; 16926#L10 assume !(~n < 1); 16925#L12 assume !(1 == ~n); 16791#L15 call #t~ret4 := fibo2(~n - 1);< 16796#fibo2ENTRY ~n := #in~n; 16797#L20 assume !(~n < 1); 16979#L22 assume !(1 == ~n); 16977#L25 call #t~ret6 := fibo1(~n - 1);< 16978#fibo1ENTRY ~n := #in~n; 17027#L10 assume !(~n < 1); 17025#L12 assume 1 == ~n;#res := 1; 17023#fibo1FINAL assume true; 16976#fibo1EXIT >#46#return; 16966#L25-1 call #t~ret7 := fibo1(~n - 2);< 16970#fibo1ENTRY ~n := #in~n; 17016#L10 assume ~n < 1;#res := 0; 17014#fibo1FINAL assume true; 17010#fibo1EXIT >#48#return; 17009#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 17006#fibo2FINAL assume true; 16993#fibo2EXIT >#50#return; 16790#L15-1 [2022-02-21 04:19:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 1 times [2022-02-21 04:19:59,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:59,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119561117] [2022-02-21 04:19:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:59,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:19:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:19:59,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {20197#true} assume !(~n < 1); {20197#true} is VALID [2022-02-21 04:19:59,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {20197#true} assume 1 == ~n;#res := 1; {20197#true} is VALID [2022-02-21 04:19:59,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:19:59,407 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20197#true} {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #46#return; {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:19:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:19:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:19:59,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:19:59,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:19:59,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20197#true} {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #48#return; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {20197#true} ~n := #in~n; {20223#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {20223#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {20224#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:19:59,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {20224#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:19:59,417 INFO L272 TraceCheckUtils]: 3: Hoare triple {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {20197#true} is VALID [2022-02-21 04:19:59,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:19:59,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {20197#true} assume !(~n < 1); {20197#true} is VALID [2022-02-21 04:19:59,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {20197#true} assume 1 == ~n;#res := 1; {20197#true} is VALID [2022-02-21 04:19:59,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:19:59,418 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20197#true} {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #46#return; {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:19:59,418 INFO L272 TraceCheckUtils]: 9: Hoare triple {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {20197#true} is VALID [2022-02-21 04:19:59,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:19:59,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:19:59,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:19:59,419 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {20197#true} {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #48#return; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} assume true; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,420 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20235#(<= 2 |fibo2_#in~n|)} {20205#(<= fibo1_~n 2)} #50#return; {20198#false} is VALID [2022-02-21 04:19:59,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {20197#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20197#true} is VALID [2022-02-21 04:19:59,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {20197#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {20199#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 04:19:59,421 INFO L272 TraceCheckUtils]: 2: Hoare triple {20199#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {20200#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:19:59,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {20200#(<= |fibo1_#in~n| 4)} ~n := #in~n; {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:19:59,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {20201#(<= fibo1_~n 4)} assume !(~n < 1); {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:19:59,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {20201#(<= fibo1_~n 4)} assume !(1 == ~n); {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:19:59,423 INFO L272 TraceCheckUtils]: 6: Hoare triple {20201#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {20202#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:19:59,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {20202#(<= |fibo2_#in~n| 3)} ~n := #in~n; {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:59,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {20203#(<= fibo2_~n 3)} assume !(~n < 1); {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:59,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {20203#(<= fibo2_~n 3)} assume !(1 == ~n); {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:59,424 INFO L272 TraceCheckUtils]: 10: Hoare triple {20203#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {20204#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:59,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {20204#(<= |fibo1_#in~n| 2)} ~n := #in~n; {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:19:59,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {20205#(<= fibo1_~n 2)} assume !(~n < 1); {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:19:59,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {20205#(<= fibo1_~n 2)} assume !(1 == ~n); {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:19:59,425 INFO L272 TraceCheckUtils]: 14: Hoare triple {20205#(<= fibo1_~n 2)} call #t~ret4 := fibo2(~n - 1); {20197#true} is VALID [2022-02-21 04:19:59,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {20197#true} ~n := #in~n; {20223#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {20223#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {20224#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:19:59,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {20224#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:19:59,426 INFO L272 TraceCheckUtils]: 18: Hoare triple {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {20197#true} is VALID [2022-02-21 04:19:59,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:19:59,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {20197#true} assume !(~n < 1); {20197#true} is VALID [2022-02-21 04:19:59,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {20197#true} assume 1 == ~n;#res := 1; {20197#true} is VALID [2022-02-21 04:19:59,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:19:59,427 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20197#true} {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #46#return; {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:19:59,427 INFO L272 TraceCheckUtils]: 24: Hoare triple {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {20197#true} is VALID [2022-02-21 04:19:59,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:19:59,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:19:59,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:19:59,428 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20197#true} {20225#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #48#return; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} assume true; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,429 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20235#(<= 2 |fibo2_#in~n|)} {20205#(<= fibo1_~n 2)} #50#return; {20198#false} is VALID [2022-02-21 04:19:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 04:19:59,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:59,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119561117] [2022-02-21 04:19:59,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119561117] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:59,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419603302] [2022-02-21 04:19:59,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:59,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:59,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:59,432 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 04:19:59,433 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 04:19:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 04:19:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:59,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {20197#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20197#true} is VALID [2022-02-21 04:19:59,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {20197#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {20199#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 04:19:59,662 INFO L272 TraceCheckUtils]: 2: Hoare triple {20199#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {20200#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:19:59,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {20200#(<= |fibo1_#in~n| 4)} ~n := #in~n; {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:19:59,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {20201#(<= fibo1_~n 4)} assume !(~n < 1); {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:19:59,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {20201#(<= fibo1_~n 4)} assume !(1 == ~n); {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:19:59,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {20201#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {20202#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:19:59,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {20202#(<= |fibo2_#in~n| 3)} ~n := #in~n; {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:59,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {20203#(<= fibo2_~n 3)} assume !(~n < 1); {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:59,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {20203#(<= fibo2_~n 3)} assume !(1 == ~n); {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:19:59,665 INFO L272 TraceCheckUtils]: 10: Hoare triple {20203#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {20204#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:19:59,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {20204#(<= |fibo1_#in~n| 2)} ~n := #in~n; {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:19:59,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {20205#(<= fibo1_~n 2)} assume !(~n < 1); {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:19:59,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {20205#(<= fibo1_~n 2)} assume !(1 == ~n); {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:19:59,666 INFO L272 TraceCheckUtils]: 14: Hoare triple {20205#(<= fibo1_~n 2)} call #t~ret4 := fibo2(~n - 1); {20197#true} is VALID [2022-02-21 04:19:59,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {20197#true} ~n := #in~n; {20284#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {20284#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {20284#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {20284#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {20284#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,667 INFO L272 TraceCheckUtils]: 18: Hoare triple {20284#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {20197#true} is VALID [2022-02-21 04:19:59,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {20197#true} ~n := #in~n; {20297#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {20297#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {20301#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {20301#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {20301#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {20301#(<= 1 |fibo1_#in~n|)} assume true; {20301#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,669 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20301#(<= 1 |fibo1_#in~n|)} {20284#(<= fibo2_~n |fibo2_#in~n|)} #46#return; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,670 INFO L272 TraceCheckUtils]: 24: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {20197#true} is VALID [2022-02-21 04:19:59,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:19:59,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:19:59,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:19:59,670 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20197#true} {20235#(<= 2 |fibo2_#in~n|)} #48#return; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} assume true; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:59,672 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20235#(<= 2 |fibo2_#in~n|)} {20205#(<= fibo1_~n 2)} #50#return; {20198#false} is VALID [2022-02-21 04:19:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:19:59,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:00,098 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20235#(<= 2 |fibo2_#in~n|)} {20205#(<= fibo1_~n 2)} #50#return; {20198#false} is VALID [2022-02-21 04:20:00,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} assume true; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,100 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20197#true} {20235#(<= 2 |fibo2_#in~n|)} #48#return; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:20:00,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:20:00,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:20:00,100 INFO L272 TraceCheckUtils]: 24: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {20197#true} is VALID [2022-02-21 04:20:00,101 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20301#(<= 1 |fibo1_#in~n|)} {20362#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} #46#return; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {20301#(<= 1 |fibo1_#in~n|)} assume true; {20301#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {20301#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {20301#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {20375#(or (< fibo1_~n 1) (<= 1 |fibo1_#in~n|))} assume !(~n < 1); {20301#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {20197#true} ~n := #in~n; {20375#(or (< fibo1_~n 1) (<= 1 |fibo1_#in~n|))} is VALID [2022-02-21 04:20:00,102 INFO L272 TraceCheckUtils]: 18: Hoare triple {20362#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {20197#true} is VALID [2022-02-21 04:20:00,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {20362#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} assume !(1 == ~n); {20362#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} is VALID [2022-02-21 04:20:00,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {20362#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} assume !(~n < 1); {20362#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} is VALID [2022-02-21 04:20:00,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {20197#true} ~n := #in~n; {20362#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} is VALID [2022-02-21 04:20:00,103 INFO L272 TraceCheckUtils]: 14: Hoare triple {20205#(<= fibo1_~n 2)} call #t~ret4 := fibo2(~n - 1); {20197#true} is VALID [2022-02-21 04:20:00,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {20205#(<= fibo1_~n 2)} assume !(1 == ~n); {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:00,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {20205#(<= fibo1_~n 2)} assume !(~n < 1); {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:00,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {20204#(<= |fibo1_#in~n| 2)} ~n := #in~n; {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:00,104 INFO L272 TraceCheckUtils]: 10: Hoare triple {20203#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {20204#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:00,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {20203#(<= fibo2_~n 3)} assume !(1 == ~n); {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:00,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {20203#(<= fibo2_~n 3)} assume !(~n < 1); {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:00,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {20202#(<= |fibo2_#in~n| 3)} ~n := #in~n; {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:00,106 INFO L272 TraceCheckUtils]: 6: Hoare triple {20201#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {20202#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:00,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {20201#(<= fibo1_~n 4)} assume !(1 == ~n); {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:00,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {20201#(<= fibo1_~n 4)} assume !(~n < 1); {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:00,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {20200#(<= |fibo1_#in~n| 4)} ~n := #in~n; {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:00,107 INFO L272 TraceCheckUtils]: 2: Hoare triple {20199#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {20200#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:00,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {20197#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {20199#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 04:20:00,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {20197#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20197#true} is VALID [2022-02-21 04:20:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:20:00,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419603302] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:00,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:00,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2022-02-21 04:20:00,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795175335] [2022-02-21 04:20:00,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:00,109 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:00,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1626884941, now seen corresponding path program 1 times [2022-02-21 04:20:00,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:00,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177023853] [2022-02-21 04:20:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:00,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:00,118 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:00,530 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:00,530 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:00,530 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:00,530 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:00,530 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:00,530 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:00,530 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:00,530 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:00,530 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration6_Loop [2022-02-21 04:20:00,530 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:00,530 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:00,532 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 04:20:00,534 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 04:20:00,536 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 04:20:00,537 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 04:20:00,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 04:20:00,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 04:20:00,547 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 04:20:00,549 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 04:20:00,551 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 04:20:00,626 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:00,626 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:00,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:00,628 INFO L229 MonitoredProcess]: Starting monitored process 52 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 04:20:00,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 04:20:00,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:00,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:00,651 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:00,651 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:00,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:00,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:00,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:00,668 INFO L229 MonitoredProcess]: Starting monitored process 53 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 04:20:00,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 04:20:00,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:00,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:00,686 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:00,686 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:00,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:00,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:00,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:00,702 INFO L229 MonitoredProcess]: Starting monitored process 54 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 04:20:00,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 04:20:00,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:00,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:00,725 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:00,725 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:00,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:00,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:00,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:00,750 INFO L229 MonitoredProcess]: Starting monitored process 55 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 04:20:00,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 04:20:00,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:00,753 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:00,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-02-21 04:20:00,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:00,784 INFO L229 MonitoredProcess]: Starting monitored process 56 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 04:20:00,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 04:20:00,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:00,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:01,864 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:01,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:01,868 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:01,868 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:01,868 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:01,868 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:01,868 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:01,868 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:01,868 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:01,868 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:01,868 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration6_Loop [2022-02-21 04:20:01,868 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:01,868 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:01,869 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 04:20:01,877 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 04:20:01,878 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 04:20:01,880 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 04:20:01,881 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 04:20:01,883 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 04:20:01,885 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 04:20:01,896 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 04:20:01,898 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 04:20:01,984 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:01,985 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:01,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:01,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:01,986 INFO L229 MonitoredProcess]: Starting monitored process 57 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 04:20:01,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 04:20:01,990 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 04:20:01,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:01,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:01,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:01,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:01,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:01,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:01,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:02,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:02,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:02,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:02,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:02,030 INFO L229 MonitoredProcess]: Starting monitored process 58 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 04:20:02,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 04:20:02,032 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 04:20:02,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:02,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:02,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:02,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:02,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:02,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:02,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:02,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:02,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:02,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:02,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:02,071 INFO L229 MonitoredProcess]: Starting monitored process 59 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 04:20:02,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 04:20:02,073 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 04:20:02,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:02,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:02,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:02,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:02,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:02,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:02,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:02,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:02,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:02,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:02,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:02,112 INFO L229 MonitoredProcess]: Starting monitored process 60 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 04:20:02,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 04:20:02,114 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 04:20:02,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:02,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:02,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:02,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:02,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:02,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:02,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:02,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:02,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:02,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:02,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:02,153 INFO L229 MonitoredProcess]: Starting monitored process 61 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 04:20:02,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 04:20:02,155 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 04:20:02,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:02,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:02,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:02,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:02,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:02,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:02,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:02,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:02,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:02,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:02,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:02,194 INFO L229 MonitoredProcess]: Starting monitored process 62 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 04:20:02,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 04:20:02,197 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 04:20:02,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:02,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:02,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:02,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:02,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:02,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:02,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:02,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:02,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:02,235 INFO L229 MonitoredProcess]: Starting monitored process 63 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 04:20:02,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 04:20:02,238 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 04:20:02,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:02,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:02,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:02,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:02,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:02,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:02,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:02,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:02,262 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:20:02,262 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:20:02,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:02,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:02,264 INFO L229 MonitoredProcess]: Starting monitored process 64 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 04:20:02,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 04:20:02,265 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:02,265 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:02,265 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:02,265 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:02,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:02,284 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:02,287 INFO L390 LassoCheck]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#46#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#48#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#50#return;" [2022-02-21 04:20:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:02,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {20429#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20429#unseeded} is VALID [2022-02-21 04:20:02,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {20429#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {20429#unseeded} is VALID [2022-02-21 04:20:02,556 INFO L272 TraceCheckUtils]: 2: Hoare triple {20429#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {20429#unseeded} is VALID [2022-02-21 04:20:02,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {20429#unseeded} ~n := #in~n; {20429#unseeded} is VALID [2022-02-21 04:20:02,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {20429#unseeded} assume !(~n < 1); {20429#unseeded} is VALID [2022-02-21 04:20:02,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {20429#unseeded} assume !(1 == ~n); {20429#unseeded} is VALID [2022-02-21 04:20:02,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {20429#unseeded} call #t~ret4 := fibo2(~n - 1); {20429#unseeded} is VALID [2022-02-21 04:20:02,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {20429#unseeded} ~n := #in~n; {20429#unseeded} is VALID [2022-02-21 04:20:02,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {20429#unseeded} assume !(~n < 1); {20429#unseeded} is VALID [2022-02-21 04:20:02,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {20429#unseeded} assume !(1 == ~n); {20429#unseeded} is VALID [2022-02-21 04:20:02,559 INFO L272 TraceCheckUtils]: 10: Hoare triple {20429#unseeded} call #t~ret6 := fibo1(~n - 1); {20429#unseeded} is VALID [2022-02-21 04:20:02,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {20429#unseeded} ~n := #in~n; {20429#unseeded} is VALID [2022-02-21 04:20:02,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {20429#unseeded} assume !(~n < 1); {20429#unseeded} is VALID [2022-02-21 04:20:02,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {20429#unseeded} assume !(1 == ~n); {20429#unseeded} is VALID [2022-02-21 04:20:02,560 INFO L272 TraceCheckUtils]: 14: Hoare triple {20429#unseeded} call #t~ret4 := fibo2(~n - 1); {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,562 INFO L272 TraceCheckUtils]: 18: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,565 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,565 INFO L272 TraceCheckUtils]: 24: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,567 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:02,569 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20489#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {20429#unseeded} #50#return; {20429#unseeded} is VALID [2022-02-21 04:20:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 04:20:02,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:02,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {20432#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {20541#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:02,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {20541#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {20545#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:02,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {20545#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {20545#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:02,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {20545#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {20545#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:02,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {20545#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {20555#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:02,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {20555#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {20559#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:02,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {20559#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {20559#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:02,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {20559#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {20559#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:02,987 INFO L272 TraceCheckUtils]: 8: Hoare triple {20559#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {20569#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:02,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {20569#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {20573#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {20573#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {20573#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {20573#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {20573#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,988 INFO L272 TraceCheckUtils]: 12: Hoare triple {20573#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret6 := fibo1(~n - 1); {20569#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:02,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {20569#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {20586#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {20586#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {20590#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {20590#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {20590#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {20590#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {20590#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,991 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20590#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} {20573#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} #46#return; {20600#(and (<= 2 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,991 INFO L272 TraceCheckUtils]: 18: Hoare triple {20600#(and (<= 2 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret7 := fibo1(~n - 2); {20569#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:02,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {20569#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {20569#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:02,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {20569#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {20569#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:02,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {20569#(<= |old(oldRank0)| oldRank0)} assume true; {20569#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:02,993 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20569#(<= |old(oldRank0)| oldRank0)} {20600#(and (<= 2 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} #48#return; {20600#(and (<= 2 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {20600#(and (<= 2 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {20600#(and (<= 2 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {20600#(and (<= 2 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {20600#(and (<= 2 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:02,994 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20600#(and (<= 2 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {20559#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {20442#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:20:02,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:03,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:03,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,032 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2022-02-21 04:20:03,032 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 508 transitions. cyclomatic complexity: 146 Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:03,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 508 transitions. cyclomatic complexity: 146. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 1744 states and 2390 transitions. Complement of second has 46 states. [2022-02-21 04:20:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:03,874 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:03,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 508 transitions. cyclomatic complexity: 146 [2022-02-21 04:20:03,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:03,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:03,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:03,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:03,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:03,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:03,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1744 states and 2390 transitions. [2022-02-21 04:20:03,883 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 143 [2022-02-21 04:20:03,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:03,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:03,885 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 369 states and 508 transitions. cyclomatic complexity: 146 [2022-02-21 04:20:03,897 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 58 examples of accepted words. [2022-02-21 04:20:03,898 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:03,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:03,899 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:03,899 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 [2022-02-21 04:20:03,928 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 147 examples of accepted words. [2022-02-21 04:20:03,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 3 letters. Loop has 5 letters. [2022-02-21 04:20:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 3 letters. Loop has 5 letters. [2022-02-21 04:20:03,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 3 letters. Loop has 5 letters. [2022-02-21 04:20:03,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 14 letters. [2022-02-21 04:20:03,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 14 letters. [2022-02-21 04:20:03,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 14 letters. [2022-02-21 04:20:03,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 1744 letters. Loop has 1744 letters. [2022-02-21 04:20:03,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 1744 letters. Loop has 1744 letters. [2022-02-21 04:20:03,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 1744 letters. Loop has 1744 letters. [2022-02-21 04:20:03,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 369 letters. Loop has 369 letters. [2022-02-21 04:20:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 369 letters. Loop has 369 letters. [2022-02-21 04:20:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 369 letters. Loop has 369 letters. [2022-02-21 04:20:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:20:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:20:03,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:20:03,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:03,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:03,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:03,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:20:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:20:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:20:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:03,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:03,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:03,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:03,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:03,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:03,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:03,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:20:03,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:20:03,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:20:03,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:03,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:03,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:03,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:03,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:03,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:03,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:03,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:03,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:03,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:03,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 39 letters. [2022-02-21 04:20:03,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 39 letters. [2022-02-21 04:20:03,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 39 letters. [2022-02-21 04:20:03,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:03,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:03,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:03,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:03,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:03,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:03,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 32 letters. Loop has 14 letters. [2022-02-21 04:20:03,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 32 letters. Loop has 14 letters. [2022-02-21 04:20:03,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 32 letters. Loop has 14 letters. [2022-02-21 04:20:03,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:03,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 32 letters. Loop has 89 letters. [2022-02-21 04:20:03,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 32 letters. Loop has 89 letters. [2022-02-21 04:20:03,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 32 letters. Loop has 89 letters. [2022-02-21 04:20:03,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 106 letters. [2022-02-21 04:20:03,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 106 letters. [2022-02-21 04:20:03,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 106 letters. [2022-02-21 04:20:03,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 20 letters. [2022-02-21 04:20:03,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 20 letters. [2022-02-21 04:20:03,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 20 letters. [2022-02-21 04:20:03,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:20:03,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:20:03,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:20:03,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 95 letters. [2022-02-21 04:20:03,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 95 letters. [2022-02-21 04:20:03,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 95 letters. [2022-02-21 04:20:03,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 32 letters. Loop has 120 letters. [2022-02-21 04:20:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 32 letters. Loop has 120 letters. [2022-02-21 04:20:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 32 letters. Loop has 120 letters. [2022-02-21 04:20:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 32 letters. Loop has 45 letters. [2022-02-21 04:20:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 32 letters. Loop has 45 letters. [2022-02-21 04:20:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 32 letters. Loop has 45 letters. [2022-02-21 04:20:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 32 letters. Loop has 57 letters. [2022-02-21 04:20:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 32 letters. Loop has 57 letters. [2022-02-21 04:20:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 32 letters. Loop has 57 letters. [2022-02-21 04:20:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 71 letters. [2022-02-21 04:20:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 71 letters. [2022-02-21 04:20:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 71 letters. [2022-02-21 04:20:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 134 letters. [2022-02-21 04:20:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 134 letters. [2022-02-21 04:20:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 134 letters. [2022-02-21 04:20:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 59 letters. [2022-02-21 04:20:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 59 letters. [2022-02-21 04:20:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 59 letters. [2022-02-21 04:20:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 63 letters. [2022-02-21 04:20:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 63 letters. [2022-02-21 04:20:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 63 letters. [2022-02-21 04:20:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 53 letters. Loop has 14 letters. [2022-02-21 04:20:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 53 letters. Loop has 14 letters. [2022-02-21 04:20:03,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 53 letters. Loop has 14 letters. [2022-02-21 04:20:03,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:03,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 14 letters. [2022-02-21 04:20:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 14 letters. [2022-02-21 04:20:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 14 letters. [2022-02-21 04:20:03,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 60 letters. Loop has 58 letters. [2022-02-21 04:20:03,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 60 letters. Loop has 58 letters. [2022-02-21 04:20:03,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 60 letters. Loop has 58 letters. [2022-02-21 04:20:03,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:03,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:03,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:03,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 64 letters. [2022-02-21 04:20:03,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 64 letters. [2022-02-21 04:20:03,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 64 letters. [2022-02-21 04:20:03,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:03,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:03,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:03,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:03,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:03,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:03,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:03,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:03,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:03,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:03,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:03,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:03,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:03,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:03,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:03,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:03,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:03,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 51 letters. Loop has 14 letters. [2022-02-21 04:20:03,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 51 letters. Loop has 14 letters. [2022-02-21 04:20:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 51 letters. Loop has 14 letters. [2022-02-21 04:20:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:03,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:03,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:03,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:03,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 47 letters. Loop has 64 letters. [2022-02-21 04:20:03,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 47 letters. Loop has 64 letters. [2022-02-21 04:20:03,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 47 letters. Loop has 64 letters. [2022-02-21 04:20:03,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 133 letters. [2022-02-21 04:20:03,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 133 letters. [2022-02-21 04:20:03,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 133 letters. [2022-02-21 04:20:03,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 64 letters. [2022-02-21 04:20:03,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 64 letters. [2022-02-21 04:20:03,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 64 letters. [2022-02-21 04:20:03,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:03,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:03,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:03,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 60 letters. Loop has 70 letters. [2022-02-21 04:20:03,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 60 letters. Loop has 70 letters. [2022-02-21 04:20:03,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 60 letters. Loop has 70 letters. [2022-02-21 04:20:03,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:03,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:03,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:03,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 113 letters. Loop has 133 letters. [2022-02-21 04:20:03,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 113 letters. Loop has 133 letters. [2022-02-21 04:20:03,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 113 letters. Loop has 133 letters. [2022-02-21 04:20:03,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:03,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:03,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:03,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:03,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:03,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:03,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 60 letters. Loop has 147 letters. [2022-02-21 04:20:03,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 60 letters. Loop has 147 letters. [2022-02-21 04:20:03,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 60 letters. Loop has 147 letters. [2022-02-21 04:20:03,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 3 letters. Loop has 5 letters. [2022-02-21 04:20:03,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 3 letters. Loop has 5 letters. [2022-02-21 04:20:03,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 3 letters. Loop has 5 letters. [2022-02-21 04:20:03,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:03,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:03,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:03,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:03,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:03,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:03,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:03,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:03,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:03,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:03,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:03,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:03,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:03,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:03,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:03,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 26 letters. [2022-02-21 04:20:03,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 26 letters. [2022-02-21 04:20:03,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 26 letters. [2022-02-21 04:20:03,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:03,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:03,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:03,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:03,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:03,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:03,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 20 letters. [2022-02-21 04:20:03,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 20 letters. [2022-02-21 04:20:03,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 20 letters. [2022-02-21 04:20:03,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 14 letters. [2022-02-21 04:20:03,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 14 letters. [2022-02-21 04:20:03,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 14 letters. [2022-02-21 04:20:03,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:03,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:03,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:03,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:03,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:03,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:03,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:03,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:03,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:03,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:03,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:03,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:03,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:03,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:03,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:03,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:03,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:03,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:03,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:03,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 26 letters. [2022-02-21 04:20:03,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 26 letters. [2022-02-21 04:20:03,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 26 letters. [2022-02-21 04:20:03,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 20 letters. [2022-02-21 04:20:03,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 20 letters. [2022-02-21 04:20:03,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 20 letters. [2022-02-21 04:20:03,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:20:03,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:20:03,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:20:03,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:20:03,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:20:03,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:20:03,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:20:03,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:20:03,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:20:03,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 14 letters. [2022-02-21 04:20:03,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 14 letters. [2022-02-21 04:20:03,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 14 letters. [2022-02-21 04:20:03,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 26 letters. [2022-02-21 04:20:03,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 26 letters. [2022-02-21 04:20:03,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 26 letters. [2022-02-21 04:20:03,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 69 letters. [2022-02-21 04:20:03,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 69 letters. [2022-02-21 04:20:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 69 letters. [2022-02-21 04:20:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 32 letters. [2022-02-21 04:20:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 32 letters. [2022-02-21 04:20:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 32 letters. [2022-02-21 04:20:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 69 letters. [2022-02-21 04:20:03,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 69 letters. [2022-02-21 04:20:03,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 69 letters. [2022-02-21 04:20:03,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:03,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 44 letters. [2022-02-21 04:20:03,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 44 letters. [2022-02-21 04:20:04,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 44 letters. [2022-02-21 04:20:04,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 58 letters. [2022-02-21 04:20:04,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 58 letters. [2022-02-21 04:20:04,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 58 letters. [2022-02-21 04:20:04,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 83 letters. [2022-02-21 04:20:04,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 83 letters. [2022-02-21 04:20:04,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 83 letters. [2022-02-21 04:20:04,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 46 letters. [2022-02-21 04:20:04,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 46 letters. [2022-02-21 04:20:04,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 46 letters. [2022-02-21 04:20:04,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:04,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:04,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:04,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:04,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:04,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:04,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 52 letters. Loop has 14 letters. [2022-02-21 04:20:04,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 52 letters. Loop has 14 letters. [2022-02-21 04:20:04,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 52 letters. Loop has 14 letters. [2022-02-21 04:20:04,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:04,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:04,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:04,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 53 letters. Loop has 14 letters. [2022-02-21 04:20:04,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 53 letters. Loop has 14 letters. [2022-02-21 04:20:04,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 53 letters. Loop has 14 letters. [2022-02-21 04:20:04,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:04,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:04,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:04,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:04,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:04,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:04,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:04,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:04,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:04,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:04,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:04,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:04,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:04,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:04,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:04,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:04,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:04,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:04,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:04,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:04,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:04,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:04,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:04,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:04,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:04,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:04,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:04,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:04,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:04,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:04,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 51 letters. Loop has 14 letters. [2022-02-21 04:20:04,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 51 letters. Loop has 14 letters. [2022-02-21 04:20:04,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 51 letters. Loop has 14 letters. [2022-02-21 04:20:04,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:04,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:04,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:04,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:04,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:04,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 113 letters. Loop has 77 letters. [2022-02-21 04:20:04,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:04,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:04,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:04,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 64 letters. [2022-02-21 04:20:04,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 64 letters. [2022-02-21 04:20:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 64 letters. [2022-02-21 04:20:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 60 letters. Loop has 70 letters. [2022-02-21 04:20:04,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 60 letters. Loop has 70 letters. [2022-02-21 04:20:04,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 60 letters. Loop has 70 letters. [2022-02-21 04:20:04,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 60 letters. Loop has 147 letters. [2022-02-21 04:20:04,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 60 letters. Loop has 147 letters. [2022-02-21 04:20:04,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 60 letters. Loop has 147 letters. [2022-02-21 04:20:04,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 54 letters. Loop has 133 letters. [2022-02-21 04:20:04,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 54 letters. Loop has 133 letters. [2022-02-21 04:20:04,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 54 letters. Loop has 133 letters. [2022-02-21 04:20:04,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 113 letters. Loop has 133 letters. [2022-02-21 04:20:04,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 113 letters. Loop has 133 letters. [2022-02-21 04:20:04,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 113 letters. Loop has 133 letters. [2022-02-21 04:20:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 73 letters. Loop has 14 letters. [2022-02-21 04:20:04,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 73 letters. Loop has 14 letters. [2022-02-21 04:20:04,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 73 letters. Loop has 14 letters. [2022-02-21 04:20:04,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:04,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:04,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:04,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:20:04,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:20:04,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:20:04,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:04,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:04,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:04,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 70 letters. Loop has 45 letters. [2022-02-21 04:20:04,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 70 letters. Loop has 45 letters. [2022-02-21 04:20:04,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 70 letters. Loop has 45 letters. [2022-02-21 04:20:04,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:04,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:04,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:04,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:04,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:04,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:04,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 75 letters. Loop has 14 letters. [2022-02-21 04:20:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 75 letters. Loop has 14 letters. [2022-02-21 04:20:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 75 letters. Loop has 14 letters. [2022-02-21 04:20:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:04,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 94 letters. Loop has 44 letters. [2022-02-21 04:20:04,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 94 letters. Loop has 44 letters. [2022-02-21 04:20:04,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 94 letters. Loop has 44 letters. [2022-02-21 04:20:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 76 letters. Loop has 14 letters. [2022-02-21 04:20:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 76 letters. Loop has 14 letters. [2022-02-21 04:20:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 76 letters. Loop has 14 letters. [2022-02-21 04:20:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:04,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:04,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:04,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:20:04,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:20:04,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:20:04,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:04,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:04,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:04,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:20:04,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:20:04,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:20:04,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:20:04,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:20:04,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:20:04,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:04,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:04,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:04,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:20:04,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:20:04,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:20:04,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:20:04,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:20:04,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:20:04,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:20:04,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:20:04,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:20:04,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:20:04,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:20:04,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:20:04,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 64 letters. Loop has 14 letters. [2022-02-21 04:20:04,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 64 letters. Loop has 14 letters. [2022-02-21 04:20:04,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 64 letters. Loop has 14 letters. [2022-02-21 04:20:04,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 64 letters. Loop has 52 letters. [2022-02-21 04:20:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 64 letters. Loop has 52 letters. [2022-02-21 04:20:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 64 letters. Loop has 52 letters. [2022-02-21 04:20:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:20:04,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:20:04,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:20:04,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 70 letters. Loop has 20 letters. [2022-02-21 04:20:04,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 70 letters. Loop has 20 letters. [2022-02-21 04:20:04,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 70 letters. Loop has 20 letters. [2022-02-21 04:20:04,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 70 letters. Loop has 45 letters. [2022-02-21 04:20:04,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 70 letters. Loop has 45 letters. [2022-02-21 04:20:04,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 70 letters. Loop has 45 letters. [2022-02-21 04:20:04,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:04,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:04,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:04,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 70 letters. Loop has 58 letters. [2022-02-21 04:20:04,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 70 letters. Loop has 58 letters. [2022-02-21 04:20:04,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 70 letters. Loop has 58 letters. [2022-02-21 04:20:04,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:20:04,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:20:04,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:20:04,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:04,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:04,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:04,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 72 letters. Loop has 44 letters. [2022-02-21 04:20:04,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 72 letters. Loop has 44 letters. [2022-02-21 04:20:04,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 72 letters. Loop has 44 letters. [2022-02-21 04:20:04,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 94 letters. Loop has 32 letters. [2022-02-21 04:20:04,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 94 letters. Loop has 32 letters. [2022-02-21 04:20:04,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 94 letters. Loop has 32 letters. [2022-02-21 04:20:04,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 94 letters. Loop has 44 letters. [2022-02-21 04:20:04,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 94 letters. Loop has 44 letters. [2022-02-21 04:20:04,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 94 letters. Loop has 44 letters. [2022-02-21 04:20:04,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:20:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:20:04,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 38 letters. Loop has 8 letters. [2022-02-21 04:20:04,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:04,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:04,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:04,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:04,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:04,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:04,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:20:04,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:20:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 39 letters. Loop has 8 letters. [2022-02-21 04:20:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:20:04,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:20:04,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 40 letters. Loop has 8 letters. [2022-02-21 04:20:04,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:20:04,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:20:04,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:20:04,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:04,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:04,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:04,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:04,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:04,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:04,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:04,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 50 letters. Loop has 14 letters. [2022-02-21 04:20:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:20:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:20:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 37 letters. Loop has 8 letters. [2022-02-21 04:20:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 72 letters. Loop has 93 letters. [2022-02-21 04:20:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 72 letters. Loop has 93 letters. [2022-02-21 04:20:04,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 72 letters. Loop has 93 letters. [2022-02-21 04:20:04,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:04,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:04,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:04,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 90 letters. Loop has 14 letters. [2022-02-21 04:20:04,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 90 letters. Loop has 14 letters. [2022-02-21 04:20:04,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 90 letters. Loop has 14 letters. [2022-02-21 04:20:04,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 91 letters. Loop has 14 letters. [2022-02-21 04:20:04,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 91 letters. Loop has 14 letters. [2022-02-21 04:20:04,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 91 letters. Loop has 14 letters. [2022-02-21 04:20:04,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:04,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:04,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:04,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:04,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:04,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:04,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:04,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:04,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:04,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 84 letters. Loop has 38 letters. [2022-02-21 04:20:04,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 84 letters. Loop has 38 letters. [2022-02-21 04:20:04,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 84 letters. Loop has 38 letters. [2022-02-21 04:20:04,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 77 letters. Loop has 38 letters. [2022-02-21 04:20:04,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 77 letters. Loop has 38 letters. [2022-02-21 04:20:04,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 77 letters. Loop has 38 letters. [2022-02-21 04:20:04,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 78 letters. Loop has 38 letters. [2022-02-21 04:20:04,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 78 letters. Loop has 38 letters. [2022-02-21 04:20:04,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 78 letters. Loop has 38 letters. [2022-02-21 04:20:04,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:20:04,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:20:04,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:20:04,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 67 letters. Loop has 14 letters. [2022-02-21 04:20:04,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 67 letters. Loop has 14 letters. [2022-02-21 04:20:04,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 67 letters. Loop has 14 letters. [2022-02-21 04:20:04,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:04,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:04,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:04,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 80 letters. Loop has 38 letters. [2022-02-21 04:20:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 80 letters. Loop has 38 letters. [2022-02-21 04:20:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 80 letters. Loop has 38 letters. [2022-02-21 04:20:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:20:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:20:04,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 49 letters. Loop has 14 letters. [2022-02-21 04:20:04,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:04,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:04,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:04,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:04,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:04,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:04,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:04,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:04,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:04,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:04,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:04,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:04,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:04,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:04,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:04,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:04,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:04,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:04,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:04,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:04,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:04,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 67 letters. Loop has 52 letters. [2022-02-21 04:20:04,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 67 letters. Loop has 52 letters. [2022-02-21 04:20:04,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 67 letters. Loop has 52 letters. [2022-02-21 04:20:04,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:20:04,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:20:04,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:20:04,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 67 letters. Loop has 101 letters. [2022-02-21 04:20:04,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 67 letters. Loop has 101 letters. [2022-02-21 04:20:04,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 67 letters. Loop has 101 letters. [2022-02-21 04:20:04,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:20:04,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:20:04,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:20:04,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:04,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:04,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:04,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 67 letters. Loop has 14 letters. [2022-02-21 04:20:04,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 67 letters. Loop has 14 letters. [2022-02-21 04:20:04,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 67 letters. Loop has 14 letters. [2022-02-21 04:20:04,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 32 letters. [2022-02-21 04:20:04,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 32 letters. [2022-02-21 04:20:04,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 32 letters. [2022-02-21 04:20:04,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 33 letters. [2022-02-21 04:20:04,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 33 letters. [2022-02-21 04:20:04,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 33 letters. [2022-02-21 04:20:04,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:04,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:04,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:04,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 84 letters. Loop has 93 letters. [2022-02-21 04:20:04,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 84 letters. Loop has 93 letters. [2022-02-21 04:20:04,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 84 letters. Loop has 93 letters. [2022-02-21 04:20:04,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 72 letters. Loop has 93 letters. [2022-02-21 04:20:04,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 72 letters. Loop has 93 letters. [2022-02-21 04:20:04,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 72 letters. Loop has 93 letters. [2022-02-21 04:20:04,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 72 letters. Loop has 44 letters. [2022-02-21 04:20:04,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 72 letters. Loop has 44 letters. [2022-02-21 04:20:04,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 72 letters. Loop has 44 letters. [2022-02-21 04:20:04,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:04,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:04,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:04,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 58 letters. [2022-02-21 04:20:04,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 58 letters. [2022-02-21 04:20:04,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 58 letters. [2022-02-21 04:20:04,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:04,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:04,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:04,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 48 letters. Loop has 107 letters. [2022-02-21 04:20:04,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 48 letters. Loop has 107 letters. [2022-02-21 04:20:04,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 48 letters. Loop has 107 letters. [2022-02-21 04:20:04,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 84 letters. Loop has 38 letters. [2022-02-21 04:20:04,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 84 letters. Loop has 38 letters. [2022-02-21 04:20:04,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 84 letters. Loop has 38 letters. [2022-02-21 04:20:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 369 states and 508 transitions. cyclomatic complexity: 146 Stem has 90 letters. Loop has 14 letters. [2022-02-21 04:20:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 90 letters. Loop has 14 letters. [2022-02-21 04:20:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 Stem has 90 letters. Loop has 14 letters. [2022-02-21 04:20:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,104 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-02-21 04:20:04,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 68 transitions. Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:04,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 68 transitions. Stem has 58 letters. Loop has 26 letters. [2022-02-21 04:20:04,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 68 transitions. Stem has 32 letters. Loop has 52 letters. [2022-02-21 04:20:04,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 [2022-02-21 04:20:04,198 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 143 [2022-02-21 04:20:04,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1744 states to 1582 states and 2212 transitions. [2022-02-21 04:20:04,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 538 [2022-02-21 04:20:04,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 572 [2022-02-21 04:20:04,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1582 states and 2212 transitions. [2022-02-21 04:20:04,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:04,275 INFO L681 BuchiCegarLoop]: Abstraction has 1582 states and 2212 transitions. [2022-02-21 04:20:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states and 2212 transitions. [2022-02-21 04:20:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1505. [2022-02-21 04:20:04,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:04,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1582 states and 2212 transitions. Second operand has 1505 states, 954 states have (on average 1.2348008385744236) internal successors, (1178), 1084 states have internal predecessors, (1178), 316 states have call successors, (331), 191 states have call predecessors, (331), 235 states have return successors, (597), 229 states have call predecessors, (597), 314 states have call successors, (597) [2022-02-21 04:20:04,319 INFO L74 IsIncluded]: Start isIncluded. First operand 1582 states and 2212 transitions. Second operand has 1505 states, 954 states have (on average 1.2348008385744236) internal successors, (1178), 1084 states have internal predecessors, (1178), 316 states have call successors, (331), 191 states have call predecessors, (331), 235 states have return successors, (597), 229 states have call predecessors, (597), 314 states have call successors, (597) [2022-02-21 04:20:04,321 INFO L87 Difference]: Start difference. First operand 1582 states and 2212 transitions. Second operand has 1505 states, 954 states have (on average 1.2348008385744236) internal successors, (1178), 1084 states have internal predecessors, (1178), 316 states have call successors, (331), 191 states have call predecessors, (331), 235 states have return successors, (597), 229 states have call predecessors, (597), 314 states have call successors, (597) [2022-02-21 04:20:04,321 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:04,798 INFO L93 Difference]: Finished difference Result 4266 states and 5980 transitions. [2022-02-21 04:20:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4266 states and 5980 transitions. [2022-02-21 04:20:04,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:04,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:04,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 1505 states, 954 states have (on average 1.2348008385744236) internal successors, (1178), 1084 states have internal predecessors, (1178), 316 states have call successors, (331), 191 states have call predecessors, (331), 235 states have return successors, (597), 229 states have call predecessors, (597), 314 states have call successors, (597) Second operand 1582 states and 2212 transitions. [2022-02-21 04:20:04,817 INFO L87 Difference]: Start difference. First operand has 1505 states, 954 states have (on average 1.2348008385744236) internal successors, (1178), 1084 states have internal predecessors, (1178), 316 states have call successors, (331), 191 states have call predecessors, (331), 235 states have return successors, (597), 229 states have call predecessors, (597), 314 states have call successors, (597) Second operand 1582 states and 2212 transitions. [2022-02-21 04:20:04,817 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:05,367 INFO L93 Difference]: Finished difference Result 4364 states and 6108 transitions. [2022-02-21 04:20:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 6108 transitions. [2022-02-21 04:20:05,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:05,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:05,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:05,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 954 states have (on average 1.2348008385744236) internal successors, (1178), 1084 states have internal predecessors, (1178), 316 states have call successors, (331), 191 states have call predecessors, (331), 235 states have return successors, (597), 229 states have call predecessors, (597), 314 states have call successors, (597) [2022-02-21 04:20:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2106 transitions. [2022-02-21 04:20:05,452 INFO L704 BuchiCegarLoop]: Abstraction has 1505 states and 2106 transitions. [2022-02-21 04:20:05,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-21 04:20:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-02-21 04:20:05,453 INFO L87 Difference]: Start difference. First operand 1505 states and 2106 transitions. Second operand has 18 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:05,977 INFO L93 Difference]: Finished difference Result 1604 states and 1988 transitions. [2022-02-21 04:20:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 04:20:05,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:06,013 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 04:20:06,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1604 states and 1988 transitions. [2022-02-21 04:20:06,082 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 147 [2022-02-21 04:20:06,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1604 states to 594 states and 683 transitions. [2022-02-21 04:20:06,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2022-02-21 04:20:06,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2022-02-21 04:20:06,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 594 states and 683 transitions. [2022-02-21 04:20:06,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:06,096 INFO L681 BuchiCegarLoop]: Abstraction has 594 states and 683 transitions. [2022-02-21 04:20:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 683 transitions. [2022-02-21 04:20:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 482. [2022-02-21 04:20:06,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:06,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states and 683 transitions. Second operand has 482 states, 315 states have (on average 1.1587301587301588) internal successors, (365), 352 states have internal predecessors, (365), 99 states have call successors, (101), 76 states have call predecessors, (101), 68 states have return successors, (83), 53 states have call predecessors, (83), 65 states have call successors, (83) [2022-02-21 04:20:06,103 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states and 683 transitions. Second operand has 482 states, 315 states have (on average 1.1587301587301588) internal successors, (365), 352 states have internal predecessors, (365), 99 states have call successors, (101), 76 states have call predecessors, (101), 68 states have return successors, (83), 53 states have call predecessors, (83), 65 states have call successors, (83) [2022-02-21 04:20:06,103 INFO L87 Difference]: Start difference. First operand 594 states and 683 transitions. Second operand has 482 states, 315 states have (on average 1.1587301587301588) internal successors, (365), 352 states have internal predecessors, (365), 99 states have call successors, (101), 76 states have call predecessors, (101), 68 states have return successors, (83), 53 states have call predecessors, (83), 65 states have call successors, (83) [2022-02-21 04:20:06,104 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:06,133 INFO L93 Difference]: Finished difference Result 922 states and 1062 transitions. [2022-02-21 04:20:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1062 transitions. [2022-02-21 04:20:06,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:06,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:06,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 482 states, 315 states have (on average 1.1587301587301588) internal successors, (365), 352 states have internal predecessors, (365), 99 states have call successors, (101), 76 states have call predecessors, (101), 68 states have return successors, (83), 53 states have call predecessors, (83), 65 states have call successors, (83) Second operand 594 states and 683 transitions. [2022-02-21 04:20:06,137 INFO L87 Difference]: Start difference. First operand has 482 states, 315 states have (on average 1.1587301587301588) internal successors, (365), 352 states have internal predecessors, (365), 99 states have call successors, (101), 76 states have call predecessors, (101), 68 states have return successors, (83), 53 states have call predecessors, (83), 65 states have call successors, (83) Second operand 594 states and 683 transitions. [2022-02-21 04:20:06,137 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:06,211 INFO L93 Difference]: Finished difference Result 1065 states and 1245 transitions. [2022-02-21 04:20:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1245 transitions. [2022-02-21 04:20:06,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:06,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:06,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:06,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 315 states have (on average 1.1587301587301588) internal successors, (365), 352 states have internal predecessors, (365), 99 states have call successors, (101), 76 states have call predecessors, (101), 68 states have return successors, (83), 53 states have call predecessors, (83), 65 states have call successors, (83) [2022-02-21 04:20:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 549 transitions. [2022-02-21 04:20:06,227 INFO L704 BuchiCegarLoop]: Abstraction has 482 states and 549 transitions. [2022-02-21 04:20:06,228 INFO L587 BuchiCegarLoop]: Abstraction has 482 states and 549 transitions. [2022-02-21 04:20:06,228 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:20:06,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 549 transitions. [2022-02-21 04:20:06,230 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 102 [2022-02-21 04:20:06,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:06,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:06,230 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:06,230 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:06,231 INFO L791 eck$LassoCheckResult]: Stem: 37404#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 37405#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; 37432#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 37466#fibo1ENTRY ~n := #in~n; 37495#L10 assume !(~n < 1); 37493#L12 assume !(1 == ~n); 37443#L15 call #t~ret4 := fibo2(~n - 1);< 37487#fibo2ENTRY ~n := #in~n; 37482#L20 assume !(~n < 1); 37478#L22 assume !(1 == ~n); 37473#L25 call #t~ret6 := fibo1(~n - 1);< 37475#fibo1ENTRY ~n := #in~n; 37497#L10 assume !(~n < 1); 37500#L12 assume !(1 == ~n); 37490#L15 call #t~ret4 := fibo2(~n - 1);< 37491#fibo2ENTRY ~n := #in~n; 37503#L20 assume !(~n < 1); 37502#L22 assume 1 == ~n;#res := 1; 37499#fibo2FINAL assume true; 37489#fibo2EXIT >#50#return; 37484#L15-1 call #t~ret5 := fibo2(~n - 2);< 37485#fibo2ENTRY ~n := #in~n; 37498#L20 assume ~n < 1;#res := 0; 37488#fibo2FINAL assume true; 37483#fibo2EXIT >#52#return; 37479#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 37476#fibo1FINAL assume true; 37471#fibo1EXIT >#46#return; 37468#L25-1 call #t~ret7 := fibo1(~n - 2);< 37470#fibo1ENTRY ~n := #in~n; 37535#L10 assume !(~n < 1); 37532#L12 assume 1 == ~n;#res := 1; 37533#fibo1FINAL assume true; 37467#fibo1EXIT >#48#return; 37442#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 37444#fibo2FINAL assume true; 37693#fibo2EXIT >#50#return; 37512#L15-1 [2022-02-21 04:20:06,231 INFO L793 eck$LassoCheckResult]: Loop: 37512#L15-1 call #t~ret5 := fibo2(~n - 2);< 37523#fibo2ENTRY ~n := #in~n; 37521#L20 assume !(~n < 1); 37518#L22 assume !(1 == ~n); 37506#L25 call #t~ret6 := fibo1(~n - 1);< 37514#fibo1ENTRY ~n := #in~n; 37589#L10 assume !(~n < 1); 37588#L12 assume 1 == ~n;#res := 1; 37587#fibo1FINAL assume true; 37567#fibo1EXIT >#46#return; 37528#L25-1 call #t~ret7 := fibo1(~n - 2);< 37562#fibo1ENTRY ~n := #in~n; 37554#L10 assume !(~n < 1); 37546#L12 assume !(1 == ~n); 37511#L15 call #t~ret4 := fibo2(~n - 1);< 37525#fibo2ENTRY ~n := #in~n; 37526#L20 assume !(~n < 1); 37550#L22 assume 1 == ~n;#res := 1; 37548#fibo2FINAL assume true; 37542#fibo2EXIT >#50#return; 37512#L15-1 [2022-02-21 04:20:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash -979062994, now seen corresponding path program 1 times [2022-02-21 04:20:06,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:06,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006291603] [2022-02-21 04:20:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:06,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:06,260 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:06,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1176615322, now seen corresponding path program 1 times [2022-02-21 04:20:06,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:06,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069022560] [2022-02-21 04:20:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 04:20:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {41449#true} ~n := #in~n; {41464#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {41464#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {41464#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {41464#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {41465#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:06,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {41465#(<= |fibo1_#in~n| 1)} assume true; {41465#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:06,301 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41465#(<= |fibo1_#in~n| 1)} {41449#true} #46#return; {41456#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:06,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:20:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:06,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:06,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {41449#true} assume 1 == ~n;#res := 1; {41449#true} is VALID [2022-02-21 04:20:06,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {41449#true} assume true; {41449#true} is VALID [2022-02-21 04:20:06,304 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41449#true} {41450#false} #50#return; {41450#false} is VALID [2022-02-21 04:20:06,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {41449#true} call #t~ret5 := fibo2(~n - 2); {41449#true} is VALID [2022-02-21 04:20:06,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:06,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:06,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {41449#true} assume !(1 == ~n); {41449#true} is VALID [2022-02-21 04:20:06,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {41449#true} call #t~ret6 := fibo1(~n - 1); {41449#true} is VALID [2022-02-21 04:20:06,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {41449#true} ~n := #in~n; {41464#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {41464#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {41464#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {41464#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {41465#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:06,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {41465#(<= |fibo1_#in~n| 1)} assume true; {41465#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:06,307 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {41465#(<= |fibo1_#in~n| 1)} {41449#true} #46#return; {41456#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:06,307 INFO L272 TraceCheckUtils]: 10: Hoare triple {41456#(<= fibo2_~n 2)} call #t~ret7 := fibo1(~n - 2); {41457#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:06,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {41457#(<= |fibo1_#in~n| 0)} ~n := #in~n; {41458#(<= fibo1_~n 0)} is VALID [2022-02-21 04:20:06,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {41458#(<= fibo1_~n 0)} assume !(~n < 1); {41450#false} is VALID [2022-02-21 04:20:06,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {41450#false} assume !(1 == ~n); {41450#false} is VALID [2022-02-21 04:20:06,308 INFO L272 TraceCheckUtils]: 14: Hoare triple {41450#false} call #t~ret4 := fibo2(~n - 1); {41449#true} is VALID [2022-02-21 04:20:06,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:06,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:06,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {41449#true} assume 1 == ~n;#res := 1; {41449#true} is VALID [2022-02-21 04:20:06,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {41449#true} assume true; {41449#true} is VALID [2022-02-21 04:20:06,309 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {41449#true} {41450#false} #50#return; {41450#false} is VALID [2022-02-21 04:20:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 04:20:06,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:06,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069022560] [2022-02-21 04:20:06,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069022560] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:06,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969471812] [2022-02-21 04:20:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:06,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:06,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:06,311 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:06,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-02-21 04:20:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:20:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:06,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {41449#true} call #t~ret5 := fibo2(~n - 2); {41449#true} is VALID [2022-02-21 04:20:06,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:06,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:06,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {41449#true} assume !(1 == ~n); {41449#true} is VALID [2022-02-21 04:20:06,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {41449#true} call #t~ret6 := fibo1(~n - 1); {41449#true} is VALID [2022-02-21 04:20:06,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {41449#true} ~n := #in~n; {41484#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:06,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {41484#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {41484#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:06,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {41484#(<= |fibo1_#in~n| fibo1_~n)} assume 1 == ~n;#res := 1; {41465#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:06,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {41465#(<= |fibo1_#in~n| 1)} assume true; {41465#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:06,425 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {41465#(<= |fibo1_#in~n| 1)} {41449#true} #46#return; {41456#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:06,425 INFO L272 TraceCheckUtils]: 10: Hoare triple {41456#(<= fibo2_~n 2)} call #t~ret7 := fibo1(~n - 2); {41457#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:06,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {41457#(<= |fibo1_#in~n| 0)} ~n := #in~n; {41458#(<= fibo1_~n 0)} is VALID [2022-02-21 04:20:06,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {41458#(<= fibo1_~n 0)} assume !(~n < 1); {41450#false} is VALID [2022-02-21 04:20:06,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {41450#false} assume !(1 == ~n); {41450#false} is VALID [2022-02-21 04:20:06,426 INFO L272 TraceCheckUtils]: 14: Hoare triple {41450#false} call #t~ret4 := fibo2(~n - 1); {41450#false} is VALID [2022-02-21 04:20:06,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {41450#false} ~n := #in~n; {41450#false} is VALID [2022-02-21 04:20:06,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {41450#false} assume !(~n < 1); {41450#false} is VALID [2022-02-21 04:20:06,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {41450#false} assume 1 == ~n;#res := 1; {41450#false} is VALID [2022-02-21 04:20:06,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {41450#false} assume true; {41450#false} is VALID [2022-02-21 04:20:06,427 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {41450#false} {41450#false} #50#return; {41450#false} is VALID [2022-02-21 04:20:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:06,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:06,597 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {41449#true} {41450#false} #50#return; {41450#false} is VALID [2022-02-21 04:20:06,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {41449#true} assume true; {41449#true} is VALID [2022-02-21 04:20:06,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {41449#true} assume 1 == ~n;#res := 1; {41449#true} is VALID [2022-02-21 04:20:06,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:06,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:06,598 INFO L272 TraceCheckUtils]: 14: Hoare triple {41450#false} call #t~ret4 := fibo2(~n - 1); {41449#true} is VALID [2022-02-21 04:20:06,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {41450#false} assume !(1 == ~n); {41450#false} is VALID [2022-02-21 04:20:06,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {41458#(<= fibo1_~n 0)} assume !(~n < 1); {41450#false} is VALID [2022-02-21 04:20:06,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {41457#(<= |fibo1_#in~n| 0)} ~n := #in~n; {41458#(<= fibo1_~n 0)} is VALID [2022-02-21 04:20:06,599 INFO L272 TraceCheckUtils]: 10: Hoare triple {41456#(<= fibo2_~n 2)} call #t~ret7 := fibo1(~n - 2); {41457#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:06,600 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {41465#(<= |fibo1_#in~n| 1)} {41449#true} #46#return; {41456#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:06,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {41465#(<= |fibo1_#in~n| 1)} assume true; {41465#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:06,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {41566#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} assume 1 == ~n;#res := 1; {41465#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:06,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {41566#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} assume !(~n < 1); {41566#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:06,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {41449#true} ~n := #in~n; {41566#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:06,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {41449#true} call #t~ret6 := fibo1(~n - 1); {41449#true} is VALID [2022-02-21 04:20:06,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {41449#true} assume !(1 == ~n); {41449#true} is VALID [2022-02-21 04:20:06,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:06,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:06,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {41449#true} call #t~ret5 := fibo2(~n - 2); {41449#true} is VALID [2022-02-21 04:20:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 04:20:06,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969471812] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:06,602 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:06,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-02-21 04:20:06,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743679122] [2022-02-21 04:20:06,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:06,603 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:20:06,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 04:20:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 04:20:06,604 INFO L87 Difference]: Start difference. First operand 482 states and 549 transitions. cyclomatic complexity: 81 Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 04:20:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:06,742 INFO L93 Difference]: Finished difference Result 326 states and 353 transitions. [2022-02-21 04:20:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:20:06,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 04:20:06,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:06,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 353 transitions. [2022-02-21 04:20:06,767 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 04:20:06,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 271 states and 298 transitions. [2022-02-21 04:20:06,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2022-02-21 04:20:06,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2022-02-21 04:20:06,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 298 transitions. [2022-02-21 04:20:06,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:06,771 INFO L681 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2022-02-21 04:20:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 298 transitions. [2022-02-21 04:20:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-02-21 04:20:06,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:06,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states and 298 transitions. Second operand has 271 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 196 states have internal predecessors, (200), 56 states have call successors, (57), 44 states have call predecessors, (57), 34 states have return successors, (41), 30 states have call predecessors, (41), 40 states have call successors, (41) [2022-02-21 04:20:06,774 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states and 298 transitions. Second operand has 271 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 196 states have internal predecessors, (200), 56 states have call successors, (57), 44 states have call predecessors, (57), 34 states have return successors, (41), 30 states have call predecessors, (41), 40 states have call successors, (41) [2022-02-21 04:20:06,775 INFO L87 Difference]: Start difference. First operand 271 states and 298 transitions. Second operand has 271 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 196 states have internal predecessors, (200), 56 states have call successors, (57), 44 states have call predecessors, (57), 34 states have return successors, (41), 30 states have call predecessors, (41), 40 states have call successors, (41) [2022-02-21 04:20:06,775 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:06,783 INFO L93 Difference]: Finished difference Result 418 states and 464 transitions. [2022-02-21 04:20:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 464 transitions. [2022-02-21 04:20:06,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:06,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:06,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 196 states have internal predecessors, (200), 56 states have call successors, (57), 44 states have call predecessors, (57), 34 states have return successors, (41), 30 states have call predecessors, (41), 40 states have call successors, (41) Second operand 271 states and 298 transitions. [2022-02-21 04:20:06,784 INFO L87 Difference]: Start difference. First operand has 271 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 196 states have internal predecessors, (200), 56 states have call successors, (57), 44 states have call predecessors, (57), 34 states have return successors, (41), 30 states have call predecessors, (41), 40 states have call successors, (41) Second operand 271 states and 298 transitions. [2022-02-21 04:20:06,784 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:06,792 INFO L93 Difference]: Finished difference Result 418 states and 464 transitions. [2022-02-21 04:20:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 464 transitions. [2022-02-21 04:20:06,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:06,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:06,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:06,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 196 states have internal predecessors, (200), 56 states have call successors, (57), 44 states have call predecessors, (57), 34 states have return successors, (41), 30 states have call predecessors, (41), 40 states have call successors, (41) [2022-02-21 04:20:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 298 transitions. [2022-02-21 04:20:06,796 INFO L704 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2022-02-21 04:20:06,796 INFO L587 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2022-02-21 04:20:06,796 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:20:06,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 298 transitions. [2022-02-21 04:20:06,797 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 04:20:06,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:06,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:06,798 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:06,798 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:06,798 INFO L791 eck$LassoCheckResult]: Stem: 41912#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 41913#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; 41945#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 41972#fibo1ENTRY ~n := #in~n; 42005#L10 assume !(~n < 1); 42003#L12 assume !(1 == ~n); 41956#L15 call #t~ret4 := fibo2(~n - 1);< 41997#fibo2ENTRY ~n := #in~n; 41992#L20 assume !(~n < 1); 41988#L22 assume !(1 == ~n); 41982#L25 call #t~ret6 := fibo1(~n - 1);< 41985#fibo1ENTRY ~n := #in~n; 42007#L10 assume !(~n < 1); 42010#L12 assume !(1 == ~n); 42000#L15 call #t~ret4 := fibo2(~n - 1);< 42001#fibo2ENTRY ~n := #in~n; 42012#L20 assume !(~n < 1); 42011#L22 assume 1 == ~n;#res := 1; 42009#fibo2FINAL assume true; 41999#fibo2EXIT >#50#return; 41994#L15-1 call #t~ret5 := fibo2(~n - 2);< 41995#fibo2ENTRY ~n := #in~n; 42008#L20 assume ~n < 1;#res := 0; 41998#fibo2FINAL assume true; 41993#fibo2EXIT >#52#return; 41989#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 41986#fibo1FINAL assume true; 41981#fibo1EXIT >#46#return; 41978#L25-1 call #t~ret7 := fibo1(~n - 2);< 41979#fibo1ENTRY ~n := #in~n; 42052#L10 assume !(~n < 1); 42049#L12 assume !(1 == ~n); 41947#L15 call #t~ret4 := fibo2(~n - 1);< 42046#fibo2ENTRY ~n := #in~n; 42053#L20 assume !(~n < 1); 42050#L22 assume 1 == ~n;#res := 1; 42047#fibo2FINAL assume true; 42043#fibo2EXIT >#50#return; 42023#L15-1 [2022-02-21 04:20:06,798 INFO L793 eck$LassoCheckResult]: Loop: 42023#L15-1 call #t~ret5 := fibo2(~n - 2);< 42033#fibo2ENTRY ~n := #in~n; 42029#L20 assume !(~n < 1); 42027#L22 assume !(1 == ~n); 42017#L25 call #t~ret6 := fibo1(~n - 1);< 42024#fibo1ENTRY ~n := #in~n; 42038#L10 assume !(~n < 1); 42036#L12 assume !(1 == ~n); 42022#L15 call #t~ret4 := fibo2(~n - 1);< 42031#fibo2ENTRY ~n := #in~n; 42032#L20 assume !(~n < 1); 42051#L22 assume 1 == ~n;#res := 1; 42048#fibo2FINAL assume true; 42045#fibo2EXIT >#50#return; 42023#L15-1 [2022-02-21 04:20:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash 772882902, now seen corresponding path program 1 times [2022-02-21 04:20:06,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:06,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267646454] [2022-02-21 04:20:06,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:06,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:20:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:06,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:06,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,867 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:06,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:06,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:06,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:06,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {43708#true} assume !(1 == ~n); {43708#true} is VALID [2022-02-21 04:20:06,870 INFO L272 TraceCheckUtils]: 3: Hoare triple {43708#true} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:06,870 INFO L290 TraceCheckUtils]: 4: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:06,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:06,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,871 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:06,871 INFO L272 TraceCheckUtils]: 9: Hoare triple {43708#true} call #t~ret5 := fibo2(~n - 2); {43708#true} is VALID [2022-02-21 04:20:06,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:06,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,871 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:06,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {43708#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {43708#true} is VALID [2022-02-21 04:20:06,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,872 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43708#true} {43714#(<= fibo2_~n 3)} #46#return; {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-21 04:20:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:06,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:06,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,875 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {43708#true} {43709#false} #50#return; {43709#false} is VALID [2022-02-21 04:20:06,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {43708#true} is VALID [2022-02-21 04:20:06,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {43710#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 04:20:06,876 INFO L272 TraceCheckUtils]: 2: Hoare triple {43710#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {43711#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:06,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {43711#(<= |fibo1_#in~n| 4)} ~n := #in~n; {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:06,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {43712#(<= fibo1_~n 4)} assume !(~n < 1); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:06,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {43712#(<= fibo1_~n 4)} assume !(1 == ~n); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:06,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {43712#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {43713#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:06,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {43713#(<= |fibo2_#in~n| 3)} ~n := #in~n; {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {43714#(<= fibo2_~n 3)} assume !(~n < 1); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {43714#(<= fibo2_~n 3)} assume !(1 == ~n); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,878 INFO L272 TraceCheckUtils]: 10: Hoare triple {43714#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {43708#true} is VALID [2022-02-21 04:20:06,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:06,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {43708#true} assume !(1 == ~n); {43708#true} is VALID [2022-02-21 04:20:06,879 INFO L272 TraceCheckUtils]: 14: Hoare triple {43708#true} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:06,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:06,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:06,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,879 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:06,879 INFO L272 TraceCheckUtils]: 20: Hoare triple {43708#true} call #t~ret5 := fibo2(~n - 2); {43708#true} is VALID [2022-02-21 04:20:06,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:06,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,880 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:06,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {43708#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {43708#true} is VALID [2022-02-21 04:20:06,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,880 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {43708#true} {43714#(<= fibo2_~n 3)} #46#return; {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,881 INFO L272 TraceCheckUtils]: 28: Hoare triple {43714#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {43732#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:06,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {43732#(<= |fibo1_#in~n| 1)} ~n := #in~n; {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:06,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {43733#(<= fibo1_~n 1)} assume !(~n < 1); {43734#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:06,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {43734#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} assume !(1 == ~n); {43709#false} is VALID [2022-02-21 04:20:06,882 INFO L272 TraceCheckUtils]: 32: Hoare triple {43709#false} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:06,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:06,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:06,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:06,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:06,883 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {43708#true} {43709#false} #50#return; {43709#false} is VALID [2022-02-21 04:20:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 04:20:06,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:06,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267646454] [2022-02-21 04:20:06,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267646454] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:06,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784284404] [2022-02-21 04:20:06,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:06,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:06,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:06,885 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:06,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-02-21 04:20:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:20:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:07,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {43708#true} is VALID [2022-02-21 04:20:07,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {43710#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 04:20:07,137 INFO L272 TraceCheckUtils]: 2: Hoare triple {43710#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {43711#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:07,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {43711#(<= |fibo1_#in~n| 4)} ~n := #in~n; {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {43712#(<= fibo1_~n 4)} assume !(~n < 1); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {43712#(<= fibo1_~n 4)} assume !(1 == ~n); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {43712#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {43713#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:07,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {43713#(<= |fibo2_#in~n| 3)} ~n := #in~n; {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {43714#(<= fibo2_~n 3)} assume !(~n < 1); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {43714#(<= fibo2_~n 3)} assume !(1 == ~n); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,140 INFO L272 TraceCheckUtils]: 10: Hoare triple {43714#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {43708#true} is VALID [2022-02-21 04:20:07,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:07,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:07,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {43708#true} assume !(1 == ~n); {43708#true} is VALID [2022-02-21 04:20:07,140 INFO L272 TraceCheckUtils]: 14: Hoare triple {43708#true} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:07,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:07,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:07,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:07,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:07,141 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:07,141 INFO L272 TraceCheckUtils]: 20: Hoare triple {43708#true} call #t~ret5 := fibo2(~n - 2); {43708#true} is VALID [2022-02-21 04:20:07,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:07,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:07,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:07,142 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:07,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {43708#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {43708#true} is VALID [2022-02-21 04:20:07,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:07,142 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {43708#true} {43714#(<= fibo2_~n 3)} #46#return; {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,143 INFO L272 TraceCheckUtils]: 28: Hoare triple {43714#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {43732#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:07,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {43732#(<= |fibo1_#in~n| 1)} ~n := #in~n; {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {43733#(<= fibo1_~n 1)} assume !(~n < 1); {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {43733#(<= fibo1_~n 1)} assume !(1 == ~n); {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,144 INFO L272 TraceCheckUtils]: 32: Hoare triple {43733#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:07,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {43708#true} ~n := #in~n; {43851#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {43851#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {43855#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {43855#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {43855#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {43855#(<= 1 |fibo2_#in~n|)} assume true; {43855#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,146 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {43855#(<= 1 |fibo2_#in~n|)} {43733#(<= fibo1_~n 1)} #50#return; {43709#false} is VALID [2022-02-21 04:20:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 04:20:07,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:07,436 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {43855#(<= 1 |fibo2_#in~n|)} {43733#(<= fibo1_~n 1)} #50#return; {43709#false} is VALID [2022-02-21 04:20:07,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {43855#(<= 1 |fibo2_#in~n|)} assume true; {43855#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {43855#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {43855#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {43877#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {43855#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {43708#true} ~n := #in~n; {43877#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-21 04:20:07,438 INFO L272 TraceCheckUtils]: 32: Hoare triple {43733#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:07,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {43733#(<= fibo1_~n 1)} assume !(1 == ~n); {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {43733#(<= fibo1_~n 1)} assume !(~n < 1); {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {43732#(<= |fibo1_#in~n| 1)} ~n := #in~n; {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,439 INFO L272 TraceCheckUtils]: 28: Hoare triple {43714#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {43732#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:07,440 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {43708#true} {43714#(<= fibo2_~n 3)} #46#return; {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:07,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {43708#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {43708#true} is VALID [2022-02-21 04:20:07,440 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:07,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:07,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:07,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:07,441 INFO L272 TraceCheckUtils]: 20: Hoare triple {43708#true} call #t~ret5 := fibo2(~n - 2); {43708#true} is VALID [2022-02-21 04:20:07,441 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:07,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:07,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:07,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:07,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:07,441 INFO L272 TraceCheckUtils]: 14: Hoare triple {43708#true} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:07,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {43708#true} assume !(1 == ~n); {43708#true} is VALID [2022-02-21 04:20:07,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:07,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:07,442 INFO L272 TraceCheckUtils]: 10: Hoare triple {43714#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {43708#true} is VALID [2022-02-21 04:20:07,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {43714#(<= fibo2_~n 3)} assume !(1 == ~n); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {43714#(<= fibo2_~n 3)} assume !(~n < 1); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {43713#(<= |fibo2_#in~n| 3)} ~n := #in~n; {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {43712#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {43713#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:07,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {43712#(<= fibo1_~n 4)} assume !(1 == ~n); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {43712#(<= fibo1_~n 4)} assume !(~n < 1); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {43711#(<= |fibo1_#in~n| 4)} ~n := #in~n; {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,445 INFO L272 TraceCheckUtils]: 2: Hoare triple {43710#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {43711#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:07,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {43710#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 04:20:07,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {43708#true} is VALID [2022-02-21 04:20:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 04:20:07,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784284404] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:07,446 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:07,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2022-02-21 04:20:07,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821054092] [2022-02-21 04:20:07,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:07,447 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1489002864, now seen corresponding path program 1 times [2022-02-21 04:20:07,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:07,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499160002] [2022-02-21 04:20:07,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:07,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:07,455 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:07,638 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:07,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:07,638 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:07,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:07,638 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:07,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:07,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:07,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:07,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration8_Loop [2022-02-21 04:20:07,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:07,638 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:07,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 04:20:07,641 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 04:20:07,642 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 04:20:07,644 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 04:20:07,646 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 04:20:07,648 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 04:20:07,649 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 04:20:07,654 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 04:20:07,655 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 04:20:07,718 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:07,719 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:07,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:07,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,720 INFO L229 MonitoredProcess]: Starting monitored process 67 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 04:20:07,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 04:20:07,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:07,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:07,743 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:07,743 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:07,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:07,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:07,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,759 INFO L229 MonitoredProcess]: Starting monitored process 68 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 04:20:07,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 04:20:07,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:07,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:07,768 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:07,768 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:07,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:07,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:07,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,784 INFO L229 MonitoredProcess]: Starting monitored process 69 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 04:20:07,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 04:20:07,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:07,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:07,803 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:07,803 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret6=0} Honda state: {fibo2_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:07,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:07,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,820 INFO L229 MonitoredProcess]: Starting monitored process 70 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 04:20:07,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 04:20:07,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:07,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:07,842 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:07,842 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=1} Honda state: {fibo1_#t~ret4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:07,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:07,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:07,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,858 INFO L229 MonitoredProcess]: Starting monitored process 71 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 04:20:07,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 04:20:07,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:07,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:07,866 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:07,867 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:07,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:07,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:07,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,883 INFO L229 MonitoredProcess]: Starting monitored process 72 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 04:20:07,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 04:20:07,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:07,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:07,893 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:07,893 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:07,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:07,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,910 INFO L229 MonitoredProcess]: Starting monitored process 73 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 04:20:07,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 04:20:07,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:07,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:07,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:07,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:07,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,945 INFO L229 MonitoredProcess]: Starting monitored process 74 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 04:20:07,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-02-21 04:20:07,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:07,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:08,919 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:08,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:08,923 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:08,923 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:08,923 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:08,923 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:08,923 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:08,923 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,923 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:08,923 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:08,923 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration8_Loop [2022-02-21 04:20:08,923 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:08,923 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:08,924 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 04:20:08,927 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 04:20:08,929 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 04:20:08,932 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 04:20:08,933 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 04:20:08,935 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 04:20:08,936 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 04:20:08,940 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 04:20:08,942 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 04:20:08,999 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:08,999 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:08,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,001 INFO L229 MonitoredProcess]: Starting monitored process 75 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 04:20:09,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-02-21 04:20:09,002 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 04:20:09,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:09,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-02-21 04:20:09,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,041 INFO L229 MonitoredProcess]: Starting monitored process 76 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 04:20:09,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-02-21 04:20:09,044 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 04:20:09,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:09,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-02-21 04:20:09,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,078 INFO L229 MonitoredProcess]: Starting monitored process 77 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 04:20:09,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-02-21 04:20:09,081 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 04:20:09,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:09,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:09,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,142 INFO L229 MonitoredProcess]: Starting monitored process 78 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 04:20:09,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-02-21 04:20:09,144 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 04:20:09,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:09,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-02-21 04:20:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,169 INFO L229 MonitoredProcess]: Starting monitored process 79 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 04:20:09,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-02-21 04:20:09,171 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 04:20:09,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:09,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-02-21 04:20:09,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,198 INFO L229 MonitoredProcess]: Starting monitored process 80 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 04:20:09,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-02-21 04:20:09,200 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 04:20:09,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:09,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-02-21 04:20:09,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,225 INFO L229 MonitoredProcess]: Starting monitored process 81 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 04:20:09,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-02-21 04:20:09,228 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 04:20:09,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,238 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:09,239 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:20:09,240 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:20:09,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,241 INFO L229 MonitoredProcess]: Starting monitored process 82 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 04:20:09,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-02-21 04:20:09,243 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:09,243 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:09,243 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:09,243 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:09,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-02-21 04:20:09,262 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:09,264 INFO L390 LassoCheck]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#50#return;" [2022-02-21 04:20:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:20:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:09,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:09,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {43976#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {43976#unseeded} is VALID [2022-02-21 04:20:09,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {43976#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {43976#unseeded} is VALID [2022-02-21 04:20:09,561 INFO L272 TraceCheckUtils]: 2: Hoare triple {43976#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {43976#unseeded} is VALID [2022-02-21 04:20:09,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:09,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:09,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:09,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {43976#unseeded} call #t~ret4 := fibo2(~n - 1); {43976#unseeded} is VALID [2022-02-21 04:20:09,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:09,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:09,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:09,576 INFO L272 TraceCheckUtils]: 10: Hoare triple {43976#unseeded} call #t~ret6 := fibo1(~n - 1); {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,578 INFO L272 TraceCheckUtils]: 14: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,580 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,581 INFO L272 TraceCheckUtils]: 20: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,583 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,584 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {43976#unseeded} #46#return; {43976#unseeded} is VALID [2022-02-21 04:20:09,585 INFO L272 TraceCheckUtils]: 28: Hoare triple {43976#unseeded} call #t~ret7 := fibo1(~n - 2); {43976#unseeded} is VALID [2022-02-21 04:20:09,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:09,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:09,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:09,587 INFO L272 TraceCheckUtils]: 32: Hoare triple {43976#unseeded} call #t~ret4 := fibo2(~n - 1); {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:09,589 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {44024#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {43976#unseeded} #50#return; {43976#unseeded} is VALID [2022-02-21 04:20:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:09,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {43979#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {44106#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:09,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {44106#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {44110#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:09,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {44110#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {44110#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:09,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {44110#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {44110#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:09,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {44110#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {44120#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:09,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {44120#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {44124#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:09,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {44124#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {44124#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:09,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {44124#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {44124#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:09,811 INFO L272 TraceCheckUtils]: 8: Hoare triple {44124#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {44134#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:09,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {44134#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {44138#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:09,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {44138#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {44142#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:09,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {44142#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {44142#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:09,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {44142#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {44142#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:09,813 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {44142#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {44124#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {43989#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:09,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:09,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:09,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:09,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:09,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 04:20:09,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 271 states and 298 transitions. cyclomatic complexity: 35 Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:10,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 271 states and 298 transitions. cyclomatic complexity: 35. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 422 states and 463 transitions. Complement of second has 40 states. [2022-02-21 04:20:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:10,392 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:10,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:10,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:10,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:10,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:10,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:10,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:10,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:10,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 422 states and 463 transitions. [2022-02-21 04:20:10,395 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 04:20:10,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:10,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:10,396 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:10,401 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:10,401 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:10,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:10,401 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:10,402 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 422 states and 463 transitions. cyclomatic complexity: 52 [2022-02-21 04:20:10,407 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:10,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:10,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:10,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 422 letters. Loop has 422 letters. [2022-02-21 04:20:10,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 422 letters. Loop has 422 letters. [2022-02-21 04:20:10,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 422 letters. Loop has 422 letters. [2022-02-21 04:20:10,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 271 letters. Loop has 271 letters. [2022-02-21 04:20:10,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 271 letters. Loop has 271 letters. [2022-02-21 04:20:10,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 271 letters. Loop has 271 letters. [2022-02-21 04:20:10,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:10,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:10,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:10,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:10,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:10,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:10,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:10,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:10,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:10,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:10,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:10,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:10,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:10,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:10,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:10,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:10,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:10,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:10,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:10,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:10,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:10,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:10,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:10,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:10,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:10,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:10,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:10,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:10,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:10,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:10,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:10,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:10,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:10,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:10,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:10,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:10,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:10,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:10,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:10,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:10,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:10,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:10,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:10,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:10,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:10,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:10,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:10,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:10,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:10,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:10,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:10,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:10,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:10,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:10,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:10,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:10,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:10,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:10,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:10,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:10,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:10,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:10,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:10,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:10,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:10,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:10,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:10,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:10,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:10,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:10,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:10,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:10,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:10,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:10,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:10,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:10,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:10,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:10,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:10,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:10,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:10,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:10,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:10,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:10,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:10,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:10,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:10,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:10,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:10,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:10,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:10,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:10,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:10,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:10,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:10,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:10,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:10,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:10,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:10,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:10,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:10,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:10,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:10,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:10,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:10,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:10,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:10,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:10,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:10,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:10,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:10,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:10,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:10,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:10,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:10,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:10,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:10,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:10,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:10,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:10,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:10,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:10,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:10,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:10,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:10,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:10,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:10,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:10,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:10,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:10,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:10,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:10,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:10,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:10,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:10,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:10,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:10,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:10,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:10,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:10,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:10,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:10,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:10,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:10,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:10,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:10,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:10,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:10,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:10,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:10,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:10,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:10,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:10,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:10,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:10,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:10,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:10,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 422 states and 463 transitions. cyclomatic complexity: 52 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:10,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,495 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-02-21 04:20:10,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,497 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:10,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:20:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:10,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {43976#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {43976#unseeded} is VALID [2022-02-21 04:20:10,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {43976#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {43976#unseeded} is VALID [2022-02-21 04:20:10,709 INFO L272 TraceCheckUtils]: 2: Hoare triple {43976#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {43976#unseeded} is VALID [2022-02-21 04:20:10,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:10,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:10,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:10,710 INFO L272 TraceCheckUtils]: 6: Hoare triple {43976#unseeded} call #t~ret4 := fibo2(~n - 1); {43976#unseeded} is VALID [2022-02-21 04:20:10,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:10,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:10,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:10,712 INFO L272 TraceCheckUtils]: 10: Hoare triple {43976#unseeded} call #t~ret6 := fibo1(~n - 1); {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,713 INFO L272 TraceCheckUtils]: 14: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,715 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,716 INFO L272 TraceCheckUtils]: 20: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,717 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,719 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {43976#unseeded} #46#return; {43976#unseeded} is VALID [2022-02-21 04:20:10,719 INFO L272 TraceCheckUtils]: 28: Hoare triple {43976#unseeded} call #t~ret7 := fibo1(~n - 2); {43976#unseeded} is VALID [2022-02-21 04:20:10,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:10,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:10,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:10,720 INFO L272 TraceCheckUtils]: 32: Hoare triple {43976#unseeded} call #t~ret4 := fibo2(~n - 1); {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,722 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {44666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {43976#unseeded} #50#return; {43976#unseeded} is VALID [2022-02-21 04:20:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:10,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {43979#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {44748#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:10,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {44748#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {44752#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:10,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {44752#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {44752#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:10,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {44752#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {44752#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:10,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {44752#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {44762#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:10,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {44762#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {44766#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:10,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {44766#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {44766#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:10,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {44766#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {44766#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:10,883 INFO L272 TraceCheckUtils]: 8: Hoare triple {44766#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {44776#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:10,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {44776#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {44780#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:10,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {44780#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {44784#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:10,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {44784#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {44784#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:10,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {44784#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {44784#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:10,884 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {44784#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {44766#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {43989#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:10,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:10,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:10,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:10,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 04:20:10,918 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 271 states and 298 transitions. cyclomatic complexity: 35 Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,106 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 271 states and 298 transitions. cyclomatic complexity: 35. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 344 states and 375 transitions. Complement of second has 26 states. [2022-02-21 04:20:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:11,106 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:11,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:11,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:11,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:11,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:11,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:11,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:11,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 375 transitions. [2022-02-21 04:20:11,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 04:20:11,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:11,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:11,109 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:11,109 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:11,110 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:11,110 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:11,110 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 344 states and 375 transitions. cyclomatic complexity: 40 [2022-02-21 04:20:11,114 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:11,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:11,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:11,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:11,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 344 letters. Loop has 344 letters. [2022-02-21 04:20:11,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 344 letters. Loop has 344 letters. [2022-02-21 04:20:11,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 344 letters. Loop has 344 letters. [2022-02-21 04:20:11,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 271 letters. Loop has 271 letters. [2022-02-21 04:20:11,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 271 letters. Loop has 271 letters. [2022-02-21 04:20:11,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 271 letters. Loop has 271 letters. [2022-02-21 04:20:11,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:11,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:11,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:11,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:11,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:11,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:11,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:11,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:11,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:11,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:11,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:11,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:11,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:11,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:11,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:11,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:11,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:11,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:11,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:11,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:11,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:11,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:11,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:11,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:11,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:11,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:11,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:11,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:11,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:11,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:11,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:11,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:11,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:11,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:11,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:11,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:11,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:11,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:11,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:11,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:11,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:11,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:11,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:11,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:11,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:11,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:11,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:11,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:11,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:11,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:11,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:11,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:11,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:11,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:11,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:11,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:11,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:11,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:11,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:11,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:11,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:11,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:11,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:11,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:11,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:11,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:11,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:11,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:11,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:11,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:11,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:11,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:11,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:11,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:11,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:11,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:11,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:11,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:11,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:11,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:11,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:11,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:11,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:11,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:11,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:11,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:11,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:11,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:11,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:11,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:11,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:11,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:11,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:11,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:11,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:11,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:11,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:11,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:11,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:11,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:11,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:11,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:11,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:11,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:11,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:11,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:11,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:11,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:11,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:11,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:11,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,190 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2022-02-21 04:20:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 31 transitions. Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,191 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:20:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:11,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {43976#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {43976#unseeded} is VALID [2022-02-21 04:20:11,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {43976#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {43976#unseeded} is VALID [2022-02-21 04:20:11,404 INFO L272 TraceCheckUtils]: 2: Hoare triple {43976#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {43976#unseeded} is VALID [2022-02-21 04:20:11,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:11,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:11,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:11,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {43976#unseeded} call #t~ret4 := fibo2(~n - 1); {43976#unseeded} is VALID [2022-02-21 04:20:11,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:11,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:11,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:11,406 INFO L272 TraceCheckUtils]: 10: Hoare triple {43976#unseeded} call #t~ret6 := fibo1(~n - 1); {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,408 INFO L272 TraceCheckUtils]: 14: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,410 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,410 INFO L272 TraceCheckUtils]: 20: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,412 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,413 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {43976#unseeded} #46#return; {43976#unseeded} is VALID [2022-02-21 04:20:11,413 INFO L272 TraceCheckUtils]: 28: Hoare triple {43976#unseeded} call #t~ret7 := fibo1(~n - 2); {43976#unseeded} is VALID [2022-02-21 04:20:11,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:11,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:11,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:11,414 INFO L272 TraceCheckUtils]: 32: Hoare triple {43976#unseeded} call #t~ret4 := fibo2(~n - 1); {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,416 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {45212#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {43976#unseeded} #50#return; {43976#unseeded} is VALID [2022-02-21 04:20:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:11,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {43979#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {45294#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:11,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {45294#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {45298#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:11,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {45298#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {45298#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:11,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {45298#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {45298#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:11,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {45298#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {45308#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:11,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {45308#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {45312#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:11,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {45312#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {45312#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:11,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {45312#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {45312#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:11,590 INFO L272 TraceCheckUtils]: 8: Hoare triple {45312#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {45322#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:11,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {45322#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {45326#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {45326#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {45330#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {45330#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {45330#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {45330#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {45330#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,592 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {45330#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {45312#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {43989#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:11,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:11,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,623 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 04:20:11,623 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 271 states and 298 transitions. cyclomatic complexity: 35 Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,207 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 271 states and 298 transitions. cyclomatic complexity: 35. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 1102 states and 1208 transitions. Complement of second has 102 states. [2022-02-21 04:20:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:12,207 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:12,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:12,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:12,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1102 states and 1208 transitions. [2022-02-21 04:20:12,212 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 162 [2022-02-21 04:20:12,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,213 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:12,213 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:12,213 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:12,214 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:12,214 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 [2022-02-21 04:20:12,223 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 88 examples of accepted words. [2022-02-21 04:20:12,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 1102 letters. Loop has 1102 letters. [2022-02-21 04:20:12,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 1102 letters. Loop has 1102 letters. [2022-02-21 04:20:12,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 1102 letters. Loop has 1102 letters. [2022-02-21 04:20:12,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 271 letters. Loop has 271 letters. [2022-02-21 04:20:12,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 271 letters. Loop has 271 letters. [2022-02-21 04:20:12,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 271 letters. Loop has 271 letters. [2022-02-21 04:20:12,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:12,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:12,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:12,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:12,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:12,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:12,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:12,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:12,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:12,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:12,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:12,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:12,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:12,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:12,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 47 letters. Loop has 14 letters. [2022-02-21 04:20:12,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:12,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:12,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:12,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:12,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:12,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:12,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:12,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:12,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:12,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:12,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:12,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:12,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:12,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:12,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:12,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:12,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:12,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:12,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:12,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:12,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 74 letters. Loop has 14 letters. [2022-02-21 04:20:12,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:12,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:12,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:20:12,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:12,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:12,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:12,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:12,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:12,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:12,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:12,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:12,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:12,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 79 letters. Loop has 8 letters. [2022-02-21 04:20:12,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 8 letters. [2022-02-21 04:20:12,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 79 letters. Loop has 8 letters. [2022-02-21 04:20:12,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:12,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:12,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:12,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 84 letters. Loop has 26 letters. [2022-02-21 04:20:12,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 26 letters. [2022-02-21 04:20:12,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 84 letters. Loop has 26 letters. [2022-02-21 04:20:12,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 98 letters. Loop has 40 letters. [2022-02-21 04:20:12,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 98 letters. Loop has 40 letters. [2022-02-21 04:20:12,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 98 letters. Loop has 40 letters. [2022-02-21 04:20:12,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:12,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:12,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:12,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:12,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:12,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:12,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 80 letters. Loop has 8 letters. [2022-02-21 04:20:12,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 8 letters. [2022-02-21 04:20:12,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 80 letters. Loop has 8 letters. [2022-02-21 04:20:12,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:12,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:12,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:12,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 22 letters. [2022-02-21 04:20:12,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 22 letters. [2022-02-21 04:20:12,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 68 letters. Loop has 22 letters. [2022-02-21 04:20:12,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:20:12,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:20:12,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:20:12,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 98 letters. Loop has 40 letters. [2022-02-21 04:20:12,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 98 letters. Loop has 40 letters. [2022-02-21 04:20:12,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 98 letters. Loop has 40 letters. [2022-02-21 04:20:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 84 letters. Loop has 26 letters. [2022-02-21 04:20:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 26 letters. [2022-02-21 04:20:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 84 letters. Loop has 26 letters. [2022-02-21 04:20:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 84 letters. Loop has 46 letters. [2022-02-21 04:20:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 46 letters. [2022-02-21 04:20:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 84 letters. Loop has 46 letters. [2022-02-21 04:20:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 84 letters. Loop has 48 letters. [2022-02-21 04:20:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 48 letters. [2022-02-21 04:20:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 84 letters. Loop has 48 letters. [2022-02-21 04:20:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:12,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:12,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:12,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:12,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:12,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 42 letters. Loop has 8 letters. [2022-02-21 04:20:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:12,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 41 letters. Loop has 8 letters. [2022-02-21 04:20:12,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:12,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:12,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:12,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:20:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:12,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 43 letters. Loop has 8 letters. [2022-02-21 04:20:12,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:12,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:12,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:20:12,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 46 letters. [2022-02-21 04:20:12,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 46 letters. [2022-02-21 04:20:12,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 46 letters. [2022-02-21 04:20:12,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:12,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:12,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:12,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:12,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:12,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:12,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:12,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:12,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:12,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 89 letters. Loop has 40 letters. [2022-02-21 04:20:12,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 89 letters. Loop has 40 letters. [2022-02-21 04:20:12,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 89 letters. Loop has 40 letters. [2022-02-21 04:20:12,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:12,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:12,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:12,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:12,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:12,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:12,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:12,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:12,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:12,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 75 letters. Loop has 26 letters. [2022-02-21 04:20:12,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 75 letters. Loop has 26 letters. [2022-02-21 04:20:12,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 75 letters. Loop has 26 letters. [2022-02-21 04:20:12,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:12,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:12,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:12,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 75 letters. Loop has 46 letters. [2022-02-21 04:20:12,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 75 letters. Loop has 46 letters. [2022-02-21 04:20:12,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 75 letters. Loop has 46 letters. [2022-02-21 04:20:12,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:12,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:12,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:12,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 89 letters. Loop has 40 letters. [2022-02-21 04:20:12,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 89 letters. Loop has 40 letters. [2022-02-21 04:20:12,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 89 letters. Loop has 40 letters. [2022-02-21 04:20:12,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:20:12,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:20:12,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:20:12,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 75 letters. Loop has 48 letters. [2022-02-21 04:20:12,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 75 letters. Loop has 48 letters. [2022-02-21 04:20:12,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 75 letters. Loop has 48 letters. [2022-02-21 04:20:12,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 75 letters. Loop has 26 letters. [2022-02-21 04:20:12,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 75 letters. Loop has 26 letters. [2022-02-21 04:20:12,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 75 letters. Loop has 26 letters. [2022-02-21 04:20:12,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 46 letters. [2022-02-21 04:20:12,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 46 letters. [2022-02-21 04:20:12,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 46 letters. [2022-02-21 04:20:12,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:20:12,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 38 letters. Loop has 32 letters. [2022-02-21 04:20:12,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:12,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:12,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 61 letters. Loop has 26 letters. [2022-02-21 04:20:12,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:12,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:12,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:20:12,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 76 letters. Loop has 22 letters. [2022-02-21 04:20:12,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 76 letters. Loop has 22 letters. [2022-02-21 04:20:12,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 76 letters. Loop has 22 letters. [2022-02-21 04:20:12,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 90 letters. Loop has 40 letters. [2022-02-21 04:20:12,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 90 letters. Loop has 40 letters. [2022-02-21 04:20:12,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 90 letters. Loop has 40 letters. [2022-02-21 04:20:12,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:12,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:12,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:20:12,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:12,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:12,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:12,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 62 letters. Loop has 26 letters. [2022-02-21 04:20:12,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 48 letters. [2022-02-21 04:20:12,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 48 letters. [2022-02-21 04:20:12,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 82 letters. Loop has 48 letters. [2022-02-21 04:20:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:20:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 76 letters. Loop has 22 letters. [2022-02-21 04:20:12,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 76 letters. Loop has 22 letters. [2022-02-21 04:20:12,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 76 letters. Loop has 22 letters. [2022-02-21 04:20:12,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:20:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:20:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:20:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 82 letters. Loop has 26 letters. [2022-02-21 04:20:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 82 letters. Loop has 46 letters. [2022-02-21 04:20:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 46 letters. [2022-02-21 04:20:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 82 letters. Loop has 46 letters. [2022-02-21 04:20:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 90 letters. Loop has 40 letters. [2022-02-21 04:20:12,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 90 letters. Loop has 40 letters. [2022-02-21 04:20:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 90 letters. Loop has 40 letters. [2022-02-21 04:20:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:20:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,335 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-21 04:20:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 52 letters. Loop has 14 letters. [2022-02-21 04:20:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 38 letters. Loop has 28 letters. [2022-02-21 04:20:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 [2022-02-21 04:20:12,370 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 162 [2022-02-21 04:20:12,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1102 states to 538 states and 595 transitions. [2022-02-21 04:20:12,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2022-02-21 04:20:12,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2022-02-21 04:20:12,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 538 states and 595 transitions. [2022-02-21 04:20:12,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:12,383 INFO L681 BuchiCegarLoop]: Abstraction has 538 states and 595 transitions. [2022-02-21 04:20:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states and 595 transitions. [2022-02-21 04:20:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 419. [2022-02-21 04:20:12,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:12,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 538 states and 595 transitions. Second operand has 419 states, 281 states have (on average 1.092526690391459) internal successors, (307), 301 states have internal predecessors, (307), 82 states have call successors, (87), 70 states have call predecessors, (87), 56 states have return successors, (62), 47 states have call predecessors, (62), 61 states have call successors, (62) [2022-02-21 04:20:12,390 INFO L74 IsIncluded]: Start isIncluded. First operand 538 states and 595 transitions. Second operand has 419 states, 281 states have (on average 1.092526690391459) internal successors, (307), 301 states have internal predecessors, (307), 82 states have call successors, (87), 70 states have call predecessors, (87), 56 states have return successors, (62), 47 states have call predecessors, (62), 61 states have call successors, (62) [2022-02-21 04:20:12,390 INFO L87 Difference]: Start difference. First operand 538 states and 595 transitions. Second operand has 419 states, 281 states have (on average 1.092526690391459) internal successors, (307), 301 states have internal predecessors, (307), 82 states have call successors, (87), 70 states have call predecessors, (87), 56 states have return successors, (62), 47 states have call predecessors, (62), 61 states have call successors, (62) [2022-02-21 04:20:12,390 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:12,406 INFO L93 Difference]: Finished difference Result 676 states and 759 transitions. [2022-02-21 04:20:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 759 transitions. [2022-02-21 04:20:12,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:12,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:12,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 419 states, 281 states have (on average 1.092526690391459) internal successors, (307), 301 states have internal predecessors, (307), 82 states have call successors, (87), 70 states have call predecessors, (87), 56 states have return successors, (62), 47 states have call predecessors, (62), 61 states have call successors, (62) Second operand 538 states and 595 transitions. [2022-02-21 04:20:12,409 INFO L87 Difference]: Start difference. First operand has 419 states, 281 states have (on average 1.092526690391459) internal successors, (307), 301 states have internal predecessors, (307), 82 states have call successors, (87), 70 states have call predecessors, (87), 56 states have return successors, (62), 47 states have call predecessors, (62), 61 states have call successors, (62) Second operand 538 states and 595 transitions. [2022-02-21 04:20:12,409 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:12,440 INFO L93 Difference]: Finished difference Result 865 states and 998 transitions. [2022-02-21 04:20:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 998 transitions. [2022-02-21 04:20:12,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:12,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:12,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:12,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 281 states have (on average 1.092526690391459) internal successors, (307), 301 states have internal predecessors, (307), 82 states have call successors, (87), 70 states have call predecessors, (87), 56 states have return successors, (62), 47 states have call predecessors, (62), 61 states have call successors, (62) [2022-02-21 04:20:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 456 transitions. [2022-02-21 04:20:12,448 INFO L704 BuchiCegarLoop]: Abstraction has 419 states and 456 transitions. [2022-02-21 04:20:12,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:12,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 04:20:12,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-02-21 04:20:12,449 INFO L87 Difference]: Start difference. First operand 419 states and 456 transitions. Second operand has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 04:20:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:12,698 INFO L93 Difference]: Finished difference Result 229 states and 241 transitions. [2022-02-21 04:20:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 04:20:12,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 04:20:12,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:12,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 241 transitions. [2022-02-21 04:20:12,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:12,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 83 states and 86 transitions. [2022-02-21 04:20:12,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-02-21 04:20:12,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-02-21 04:20:12,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 86 transitions. [2022-02-21 04:20:12,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:12,731 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-02-21 04:20:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 86 transitions. [2022-02-21 04:20:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2022-02-21 04:20:12,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:12,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states and 86 transitions. Second operand has 66 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 13 states have call successors, (13), 12 states have call predecessors, (13), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 04:20:12,732 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states and 86 transitions. Second operand has 66 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 13 states have call successors, (13), 12 states have call predecessors, (13), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 04:20:12,732 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 66 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 13 states have call successors, (13), 12 states have call predecessors, (13), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 04:20:12,733 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:12,734 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-02-21 04:20:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-02-21 04:20:12,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:12,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:12,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 13 states have call successors, (13), 12 states have call predecessors, (13), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 83 states and 86 transitions. [2022-02-21 04:20:12,734 INFO L87 Difference]: Start difference. First operand has 66 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 13 states have call successors, (13), 12 states have call predecessors, (13), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 83 states and 86 transitions. [2022-02-21 04:20:12,735 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:12,736 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-02-21 04:20:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-02-21 04:20:12,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:12,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:12,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:12,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 13 states have call successors, (13), 12 states have call predecessors, (13), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 04:20:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2022-02-21 04:20:12,737 INFO L704 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2022-02-21 04:20:12,737 INFO L587 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2022-02-21 04:20:12,737 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:20:12,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. [2022-02-21 04:20:12,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:12,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,738 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:12,738 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-02-21 04:20:12,738 INFO L791 eck$LassoCheckResult]: Stem: 49917#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 49918#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; 49938#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 49958#fibo1ENTRY ~n := #in~n; 49967#L10 assume !(~n < 1); 49966#L12 assume !(1 == ~n); 49930#L15 call #t~ret4 := fibo2(~n - 1);< 49964#fibo2ENTRY ~n := #in~n; 49962#L20 assume !(~n < 1); 49960#L22 assume !(1 == ~n); 49927#L25 call #t~ret6 := fibo1(~n - 1);< 49932#fibo1ENTRY ~n := #in~n; 49933#L10 assume !(~n < 1); 49942#L12 assume !(1 == ~n); 49943#L15 call #t~ret4 := fibo2(~n - 1);< 49950#fibo2ENTRY ~n := #in~n; 49952#L20 assume !(~n < 1); 49953#L22 assume 1 == ~n;#res := 1; 49974#fibo2FINAL assume true; 49972#fibo2EXIT >#50#return; 49969#L15-1 call #t~ret5 := fibo2(~n - 2);< 49970#fibo2ENTRY ~n := #in~n; 49973#L20 assume ~n < 1;#res := 0; 49971#fibo2FINAL assume true; 49968#fibo2EXIT >#52#return; 49959#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 49926#fibo1FINAL assume true; 49928#fibo1EXIT >#46#return; 49929#L25-1 call #t~ret7 := fibo1(~n - 2);< 49931#fibo1ENTRY ~n := #in~n; 49965#L10 assume !(~n < 1); 49963#L12 assume 1 == ~n;#res := 1; 49961#fibo1FINAL assume true; 49936#fibo1EXIT >#48#return; 49937#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 49941#fibo2FINAL assume true; 49947#fibo2EXIT >#50#return; 49923#L15-1 [2022-02-21 04:20:12,738 INFO L793 eck$LassoCheckResult]: Loop: 49923#L15-1 call #t~ret5 := fibo2(~n - 2);< 49939#fibo2ENTRY ~n := #in~n; 49982#L20 assume !(~n < 1); 49922#L22 assume !(1 == ~n); 49925#L25 call #t~ret6 := fibo1(~n - 1);< 49934#fibo1ENTRY ~n := #in~n; 49935#L10 assume !(~n < 1); 49944#L12 assume !(1 == ~n); 49945#L15 call #t~ret4 := fibo2(~n - 1);< 49951#fibo2ENTRY ~n := #in~n; 49977#L20 assume !(~n < 1); 49981#L22 assume !(1 == ~n); 49940#L25 call #t~ret6 := fibo1(~n - 1);< 49980#fibo1ENTRY ~n := #in~n; 49979#L10 assume !(~n < 1); 49978#L12 assume !(1 == ~n); 49920#L15 call #t~ret4 := fibo2(~n - 1);< 49976#fibo2ENTRY ~n := #in~n; 49975#L20 assume !(~n < 1); 49919#L22 assume 1 == ~n;#res := 1; 49921#fibo2FINAL assume true; 49956#fibo2EXIT >#50#return; 49923#L15-1 [2022-02-21 04:20:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash -979062994, now seen corresponding path program 2 times [2022-02-21 04:20:12,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:12,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707526480] [2022-02-21 04:20:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:12,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:12,765 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash -636561399, now seen corresponding path program 2 times [2022-02-21 04:20:12,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:12,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238458521] [2022-02-21 04:20:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:12,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:12,770 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:12,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash -13748362, now seen corresponding path program 3 times [2022-02-21 04:20:12,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:12,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935662602] [2022-02-21 04:20:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:12,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-21 04:20:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:12,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,887 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:12,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:12,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:12,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:12,903 INFO L272 TraceCheckUtils]: 3: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:12,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:12,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,904 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:12,904 INFO L272 TraceCheckUtils]: 9: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:12,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:12,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,904 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:12,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {50430#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {50430#true} is VALID [2022-02-21 04:20:12,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,905 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:12,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:12,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,907 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:12,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:12,908 INFO L272 TraceCheckUtils]: 3: Hoare triple {50430#true} call #t~ret6 := fibo1(~n - 1); {50430#true} is VALID [2022-02-21 04:20:12,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:12,908 INFO L272 TraceCheckUtils]: 7: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:12,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:12,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,909 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:12,909 INFO L272 TraceCheckUtils]: 13: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:12,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:12,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,909 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:12,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {50430#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {50430#true} is VALID [2022-02-21 04:20:12,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,910 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:12,910 INFO L272 TraceCheckUtils]: 21: Hoare triple {50430#true} call #t~ret7 := fibo1(~n - 2); {50430#true} is VALID [2022-02-21 04:20:12,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:12,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,910 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:12,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {50430#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {50430#true} is VALID [2022-02-21 04:20:12,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,911 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {50430#true} {50434#(<= fibo1_~n 4)} #50#return; {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 04:20:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:12,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,914 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50430#true} {50431#false} #50#return; {50431#false} is VALID [2022-02-21 04:20:12,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {50430#true} is VALID [2022-02-21 04:20:12,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {50432#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 04:20:12,915 INFO L272 TraceCheckUtils]: 2: Hoare triple {50432#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {50433#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:12,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {50433#(<= |fibo1_#in~n| 4)} ~n := #in~n; {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:12,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {50434#(<= fibo1_~n 4)} assume !(~n < 1); {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:12,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {50434#(<= fibo1_~n 4)} assume !(1 == ~n); {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:12,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {50434#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:12,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:12,916 INFO L272 TraceCheckUtils]: 10: Hoare triple {50430#true} call #t~ret6 := fibo1(~n - 1); {50430#true} is VALID [2022-02-21 04:20:12,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:12,916 INFO L272 TraceCheckUtils]: 14: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:12,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:12,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,917 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:12,917 INFO L272 TraceCheckUtils]: 20: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:12,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:12,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,918 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:12,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {50430#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {50430#true} is VALID [2022-02-21 04:20:12,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,918 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:12,918 INFO L272 TraceCheckUtils]: 28: Hoare triple {50430#true} call #t~ret7 := fibo1(~n - 2); {50430#true} is VALID [2022-02-21 04:20:12,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:12,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,919 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:12,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {50430#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {50430#true} is VALID [2022-02-21 04:20:12,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,919 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {50430#true} {50434#(<= fibo1_~n 4)} #50#return; {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:12,920 INFO L272 TraceCheckUtils]: 37: Hoare triple {50434#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {50465#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:12,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {50465#(<= |fibo2_#in~n| 2)} ~n := #in~n; {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:12,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {50466#(<= fibo2_~n 2)} assume !(~n < 1); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:12,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {50466#(<= fibo2_~n 2)} assume !(1 == ~n); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:12,921 INFO L272 TraceCheckUtils]: 41: Hoare triple {50466#(<= fibo2_~n 2)} call #t~ret6 := fibo1(~n - 1); {50467#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:12,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {50467#(<= |fibo1_#in~n| 1)} ~n := #in~n; {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:12,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {50468#(<= fibo1_~n 1)} assume !(~n < 1); {50469#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:12,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {50469#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} assume !(1 == ~n); {50431#false} is VALID [2022-02-21 04:20:12,922 INFO L272 TraceCheckUtils]: 45: Hoare triple {50431#false} call #t~ret4 := fibo2(~n - 1); {50431#false} is VALID [2022-02-21 04:20:12,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {50431#false} ~n := #in~n; {50431#false} is VALID [2022-02-21 04:20:12,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {50431#false} assume !(~n < 1); {50431#false} is VALID [2022-02-21 04:20:12,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {50431#false} assume !(1 == ~n); {50431#false} is VALID [2022-02-21 04:20:12,923 INFO L272 TraceCheckUtils]: 49: Hoare triple {50431#false} call #t~ret6 := fibo1(~n - 1); {50431#false} is VALID [2022-02-21 04:20:12,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {50431#false} ~n := #in~n; {50431#false} is VALID [2022-02-21 04:20:12,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {50431#false} assume !(~n < 1); {50431#false} is VALID [2022-02-21 04:20:12,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {50431#false} assume !(1 == ~n); {50431#false} is VALID [2022-02-21 04:20:12,923 INFO L272 TraceCheckUtils]: 53: Hoare triple {50431#false} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:12,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:12,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:12,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:12,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:12,924 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {50430#true} {50431#false} #50#return; {50431#false} is VALID [2022-02-21 04:20:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-02-21 04:20:12,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:12,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935662602] [2022-02-21 04:20:12,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935662602] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:12,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358131917] [2022-02-21 04:20:12,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 04:20:12,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:12,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:12,926 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:12,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-02-21 04:20:12,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-21 04:20:12,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 04:20:12,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:13,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {50430#true} is VALID [2022-02-21 04:20:13,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {50432#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 04:20:13,278 INFO L272 TraceCheckUtils]: 2: Hoare triple {50432#(<= |ULTIMATE.start_main_~x~0#1| 4)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {50433#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:13,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {50433#(<= |fibo1_#in~n| 4)} ~n := #in~n; {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:13,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {50434#(<= fibo1_~n 4)} assume !(~n < 1); {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:13,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {50434#(<= fibo1_~n 4)} assume !(1 == ~n); {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:13,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {50434#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:13,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:13,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:13,280 INFO L272 TraceCheckUtils]: 10: Hoare triple {50430#true} call #t~ret6 := fibo1(~n - 1); {50430#true} is VALID [2022-02-21 04:20:13,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:13,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:13,280 INFO L272 TraceCheckUtils]: 14: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:13,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L272 TraceCheckUtils]: 20: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {50430#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {50430#true} is VALID [2022-02-21 04:20:13,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,282 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:13,282 INFO L272 TraceCheckUtils]: 28: Hoare triple {50430#true} call #t~ret7 := fibo1(~n - 2); {50430#true} is VALID [2022-02-21 04:20:13,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:13,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:13,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,282 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:13,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {50430#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {50430#true} is VALID [2022-02-21 04:20:13,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,283 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {50430#true} {50434#(<= fibo1_~n 4)} #50#return; {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:13,283 INFO L272 TraceCheckUtils]: 37: Hoare triple {50434#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {50465#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:13,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {50465#(<= |fibo2_#in~n| 2)} ~n := #in~n; {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:13,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {50466#(<= fibo2_~n 2)} assume !(~n < 1); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:13,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {50466#(<= fibo2_~n 2)} assume !(1 == ~n); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:13,285 INFO L272 TraceCheckUtils]: 41: Hoare triple {50466#(<= fibo2_~n 2)} call #t~ret6 := fibo1(~n - 1); {50467#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:13,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {50467#(<= |fibo1_#in~n| 1)} ~n := #in~n; {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:13,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {50468#(<= fibo1_~n 1)} assume !(~n < 1); {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:13,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {50468#(<= fibo1_~n 1)} assume !(1 == ~n); {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:13,286 INFO L272 TraceCheckUtils]: 45: Hoare triple {50468#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {50644#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:20:13,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {50644#(<= |fibo2_#in~n| 0)} ~n := #in~n; {50648#(<= fibo2_~n 0)} is VALID [2022-02-21 04:20:13,287 INFO L290 TraceCheckUtils]: 47: Hoare triple {50648#(<= fibo2_~n 0)} assume !(~n < 1); {50648#(<= fibo2_~n 0)} is VALID [2022-02-21 04:20:13,287 INFO L290 TraceCheckUtils]: 48: Hoare triple {50648#(<= fibo2_~n 0)} assume !(1 == ~n); {50648#(<= fibo2_~n 0)} is VALID [2022-02-21 04:20:13,288 INFO L272 TraceCheckUtils]: 49: Hoare triple {50648#(<= fibo2_~n 0)} call #t~ret6 := fibo1(~n - 1); {50658#(<= (+ |fibo1_#in~n| 1) 0)} is VALID [2022-02-21 04:20:13,288 INFO L290 TraceCheckUtils]: 50: Hoare triple {50658#(<= (+ |fibo1_#in~n| 1) 0)} ~n := #in~n; {50662#(<= (+ fibo1_~n 1) 0)} is VALID [2022-02-21 04:20:13,289 INFO L290 TraceCheckUtils]: 51: Hoare triple {50662#(<= (+ fibo1_~n 1) 0)} assume !(~n < 1); {50662#(<= (+ fibo1_~n 1) 0)} is VALID [2022-02-21 04:20:13,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {50662#(<= (+ fibo1_~n 1) 0)} assume !(1 == ~n); {50662#(<= (+ fibo1_~n 1) 0)} is VALID [2022-02-21 04:20:13,289 INFO L272 TraceCheckUtils]: 53: Hoare triple {50662#(<= (+ fibo1_~n 1) 0)} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:13,289 INFO L290 TraceCheckUtils]: 54: Hoare triple {50430#true} ~n := #in~n; {50675#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:13,290 INFO L290 TraceCheckUtils]: 55: Hoare triple {50675#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {50679#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:13,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {50679#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {50679#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:13,290 INFO L290 TraceCheckUtils]: 57: Hoare triple {50679#(<= 1 |fibo2_#in~n|)} assume true; {50679#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:13,291 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {50679#(<= 1 |fibo2_#in~n|)} {50662#(<= (+ fibo1_~n 1) 0)} #50#return; {50431#false} is VALID [2022-02-21 04:20:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-21 04:20:13,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:13,688 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {50679#(<= 1 |fibo2_#in~n|)} {50468#(<= fibo1_~n 1)} #50#return; {50431#false} is VALID [2022-02-21 04:20:13,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {50679#(<= 1 |fibo2_#in~n|)} assume true; {50679#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:13,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {50679#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {50679#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:13,689 INFO L290 TraceCheckUtils]: 55: Hoare triple {50701#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {50679#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:13,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {50430#true} ~n := #in~n; {50701#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-21 04:20:13,689 INFO L272 TraceCheckUtils]: 53: Hoare triple {50468#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:13,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {50468#(<= fibo1_~n 1)} assume !(1 == ~n); {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:13,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {50468#(<= fibo1_~n 1)} assume !(~n < 1); {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:13,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {50467#(<= |fibo1_#in~n| 1)} ~n := #in~n; {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:13,691 INFO L272 TraceCheckUtils]: 49: Hoare triple {50466#(<= fibo2_~n 2)} call #t~ret6 := fibo1(~n - 1); {50467#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:13,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {50466#(<= fibo2_~n 2)} assume !(1 == ~n); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:13,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {50466#(<= fibo2_~n 2)} assume !(~n < 1); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:13,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {50465#(<= |fibo2_#in~n| 2)} ~n := #in~n; {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:13,692 INFO L272 TraceCheckUtils]: 45: Hoare triple {50729#(<= fibo1_~n 3)} call #t~ret4 := fibo2(~n - 1); {50465#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:13,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {50729#(<= fibo1_~n 3)} assume !(1 == ~n); {50729#(<= fibo1_~n 3)} is VALID [2022-02-21 04:20:13,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {50729#(<= fibo1_~n 3)} assume !(~n < 1); {50729#(<= fibo1_~n 3)} is VALID [2022-02-21 04:20:13,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {50739#(<= |fibo1_#in~n| 3)} ~n := #in~n; {50729#(<= fibo1_~n 3)} is VALID [2022-02-21 04:20:13,694 INFO L272 TraceCheckUtils]: 41: Hoare triple {50743#(<= fibo2_~n 4)} call #t~ret6 := fibo1(~n - 1); {50739#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:13,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {50743#(<= fibo2_~n 4)} assume !(1 == ~n); {50743#(<= fibo2_~n 4)} is VALID [2022-02-21 04:20:13,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {50743#(<= fibo2_~n 4)} assume !(~n < 1); {50743#(<= fibo2_~n 4)} is VALID [2022-02-21 04:20:13,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {50753#(<= |fibo2_#in~n| 4)} ~n := #in~n; {50743#(<= fibo2_~n 4)} is VALID [2022-02-21 04:20:13,695 INFO L272 TraceCheckUtils]: 37: Hoare triple {50757#(<= fibo1_~n 6)} call #t~ret5 := fibo2(~n - 2); {50753#(<= |fibo2_#in~n| 4)} is VALID [2022-02-21 04:20:13,695 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {50430#true} {50757#(<= fibo1_~n 6)} #50#return; {50757#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {50430#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L272 TraceCheckUtils]: 28: Hoare triple {50430#true} call #t~ret7 := fibo1(~n - 2); {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {50430#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L272 TraceCheckUtils]: 20: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:13,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L272 TraceCheckUtils]: 14: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L272 TraceCheckUtils]: 10: Hoare triple {50430#true} call #t~ret6 := fibo1(~n - 1); {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:13,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {50757#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:13,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {50757#(<= fibo1_~n 6)} assume !(1 == ~n); {50757#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:13,698 INFO L290 TraceCheckUtils]: 4: Hoare triple {50757#(<= fibo1_~n 6)} assume !(~n < 1); {50757#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:13,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {50860#(<= |fibo1_#in~n| 6)} ~n := #in~n; {50757#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:13,699 INFO L272 TraceCheckUtils]: 2: Hoare triple {50864#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {50860#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:13,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {50864#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:13,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {50430#true} is VALID [2022-02-21 04:20:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-21 04:20:13,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358131917] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:13,699 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:13,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 24 [2022-02-21 04:20:13,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125228238] [2022-02-21 04:20:13,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:14,030 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:14,030 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:14,030 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:14,030 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:14,030 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:14,030 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,030 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:14,030 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:14,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration9_Loop [2022-02-21 04:20:14,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:14,031 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:14,031 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 04:20:14,033 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 04:20:14,035 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 04:20:14,036 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 04:20:14,038 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 04:20:14,039 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 04:20:14,041 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 04:20:14,046 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 04:20:14,048 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 04:20:14,110 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:14,110 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,111 INFO L229 MonitoredProcess]: Starting monitored process 84 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 04:20:14,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-02-21 04:20:14,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:14,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:14,134 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:14,134 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:14,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-02-21 04:20:14,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,151 INFO L229 MonitoredProcess]: Starting monitored process 85 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 04:20:14,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-02-21 04:20:14,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:14,153 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:14,159 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:14,160 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:14,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-02-21 04:20:14,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,176 INFO L229 MonitoredProcess]: Starting monitored process 86 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 04:20:14,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-02-21 04:20:14,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:14,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:14,199 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:14,199 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:14,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-02-21 04:20:14,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,216 INFO L229 MonitoredProcess]: Starting monitored process 87 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 04:20:14,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-02-21 04:20:14,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:14,218 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:14,238 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:14,238 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:14,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-02-21 04:20:14,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,255 INFO L229 MonitoredProcess]: Starting monitored process 88 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 04:20:14,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-02-21 04:20:14,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:14,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:14,267 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:14,267 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:14,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:14,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,284 INFO L229 MonitoredProcess]: Starting monitored process 89 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 04:20:14,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-02-21 04:20:14,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:14,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:14,293 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:14,293 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=1} Honda state: {fibo1_#t~ret4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:14,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:14,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,311 INFO L229 MonitoredProcess]: Starting monitored process 90 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 04:20:14,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-02-21 04:20:14,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:14,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:14,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-02-21 04:20:14,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,351 INFO L229 MonitoredProcess]: Starting monitored process 91 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 04:20:14,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-02-21 04:20:14,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:14,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:14,765 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:14,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:14,769 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:14,769 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:14,769 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:14,769 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:14,769 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:14,769 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,769 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:14,769 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:14,769 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-1.c_Iteration9_Loop [2022-02-21 04:20:14,769 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:14,769 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:14,770 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 04:20:14,772 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 04:20:14,773 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 04:20:14,775 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 04:20:14,777 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 04:20:14,781 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 04:20:14,783 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 04:20:14,785 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 04:20:14,786 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 04:20:14,852 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:14,852 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:14,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,855 INFO L229 MonitoredProcess]: Starting monitored process 92 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 04:20:14,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-02-21 04:20:14,857 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 04:20:14,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:14,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:14,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:14,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:14,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:14,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:14,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:14,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:14,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-02-21 04:20:14,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,891 INFO L229 MonitoredProcess]: Starting monitored process 93 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 04:20:14,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-02-21 04:20:14,894 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 04:20:14,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:14,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:14,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:14,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:14,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:14,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:14,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:14,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:14,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:14,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,932 INFO L229 MonitoredProcess]: Starting monitored process 94 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 04:20:14,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-02-21 04:20:14,934 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 04:20:14,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:14,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:14,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:14,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:14,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:14,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:14,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:14,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:14,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:14,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:14,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,960 INFO L229 MonitoredProcess]: Starting monitored process 95 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 04:20:14,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-02-21 04:20:14,963 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 04:20:14,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:14,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:14,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:14,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:14,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:14,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:14,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:14,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:15,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:15,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,001 INFO L229 MonitoredProcess]: Starting monitored process 96 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 04:20:15,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-02-21 04:20:15,004 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 04:20:15,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:15,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:15,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:15,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:15,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:15,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:15,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:15,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:15,014 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:20:15,014 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:20:15,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,016 INFO L229 MonitoredProcess]: Starting monitored process 97 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 04:20:15,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-02-21 04:20:15,021 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:15,021 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:15,021 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:15,022 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:15,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-02-21 04:20:15,040 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:15,042 INFO L390 LassoCheck]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#50#return;" [2022-02-21 04:20:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:15,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:15,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:15,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:15,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:15,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {50868#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {50868#unseeded} is VALID [2022-02-21 04:20:15,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {50868#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {50868#unseeded} is VALID [2022-02-21 04:20:15,415 INFO L272 TraceCheckUtils]: 2: Hoare triple {50868#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {50868#unseeded} is VALID [2022-02-21 04:20:15,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {50868#unseeded} ~n := #in~n; {50868#unseeded} is VALID [2022-02-21 04:20:15,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {50868#unseeded} assume !(~n < 1); {50868#unseeded} is VALID [2022-02-21 04:20:15,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {50868#unseeded} assume !(1 == ~n); {50868#unseeded} is VALID [2022-02-21 04:20:15,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {50868#unseeded} call #t~ret4 := fibo2(~n - 1); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,418 INFO L272 TraceCheckUtils]: 10: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,420 INFO L272 TraceCheckUtils]: 14: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,423 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,423 INFO L272 TraceCheckUtils]: 20: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,425 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,427 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,427 INFO L272 TraceCheckUtils]: 28: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,429 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:15,431 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {50904#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {50868#unseeded} #50#return; {50868#unseeded} is VALID [2022-02-21 04:20:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:15,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 04:20:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:15,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:15,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {50871#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {50995#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:15,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {50995#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {50999#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:15,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {50999#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {50999#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:15,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {50999#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {50999#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:15,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {50999#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {51009#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:15,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {51009#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {51013#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:15,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {51013#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {51013#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:15,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {51013#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {51013#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:15,783 INFO L272 TraceCheckUtils]: 8: Hoare triple {51013#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {51023#(<= (+ |fibo2_#in~n| 4) oldRank0)} is VALID [2022-02-21 04:20:15,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {51023#(<= (+ |fibo2_#in~n| 4) oldRank0)} ~n := #in~n; {51027#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:15,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {51027#(<= (+ fibo2_~n 4) oldRank0)} assume !(~n < 1); {51027#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:15,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {51027#(<= (+ fibo2_~n 4) oldRank0)} assume !(1 == ~n); {51027#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:15,784 INFO L272 TraceCheckUtils]: 12: Hoare triple {51027#(<= (+ fibo2_~n 4) oldRank0)} call #t~ret6 := fibo1(~n - 1); {51037#(<= (+ 5 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:15,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {51037#(<= (+ 5 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {51041#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:15,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {51041#(<= (+ fibo1_~n 5) oldRank0)} assume !(~n < 1); {51041#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:15,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {51041#(<= (+ fibo1_~n 5) oldRank0)} assume !(1 == ~n); {51041#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:15,786 INFO L272 TraceCheckUtils]: 16: Hoare triple {51041#(<= (+ fibo1_~n 5) oldRank0)} call #t~ret4 := fibo2(~n - 1); {51051#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:15,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {51051#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {51055#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:15,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {51055#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {51059#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:15,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {51059#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {51059#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:15,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {51059#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {51059#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:15,788 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {51059#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {51041#(<= (+ fibo1_~n 5) oldRank0)} #50#return; {50881#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:15,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:15,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:15,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,827 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2022-02-21 04:20:15,827 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 68 transitions. cyclomatic complexity: 3 Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:15,987 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 68 transitions. cyclomatic complexity: 3. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Result 73 states and 75 transitions. Complement of second has 11 states. [2022-02-21 04:20:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:15,988 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:15,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:15,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:15,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:15,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:15,988 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:15,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:15,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2022-02-21 04:20:15,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:15,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:15,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:15,989 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:15,989 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:15,989 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:15,989 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:15,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 21 transitions. cyclomatic complexity: 19 [2022-02-21 04:20:15,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:15,989 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:20:15,989 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 73 states and 75 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:15,990 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:20:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:20:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:20:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:20:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,993 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-21 04:20:15,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:15,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,994 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:16,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:16,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {50868#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {50868#unseeded} is VALID [2022-02-21 04:20:16,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {50868#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {50868#unseeded} is VALID [2022-02-21 04:20:16,332 INFO L272 TraceCheckUtils]: 2: Hoare triple {50868#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {50868#unseeded} is VALID [2022-02-21 04:20:16,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {50868#unseeded} ~n := #in~n; {50868#unseeded} is VALID [2022-02-21 04:20:16,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {50868#unseeded} assume !(~n < 1); {50868#unseeded} is VALID [2022-02-21 04:20:16,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {50868#unseeded} assume !(1 == ~n); {50868#unseeded} is VALID [2022-02-21 04:20:16,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {50868#unseeded} call #t~ret4 := fibo2(~n - 1); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,335 INFO L272 TraceCheckUtils]: 10: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,337 INFO L272 TraceCheckUtils]: 14: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,339 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,340 INFO L272 TraceCheckUtils]: 20: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,341 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,343 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,343 INFO L272 TraceCheckUtils]: 28: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,346 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,347 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {51183#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {50868#unseeded} #50#return; {50868#unseeded} is VALID [2022-02-21 04:20:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 04:20:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:16,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {50871#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {51274#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:16,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {51274#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {51278#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:16,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {51278#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {51278#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:16,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {51278#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {51278#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:16,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {51278#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {51288#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:16,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {51288#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {51292#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:16,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {51292#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {51292#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:16,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {51292#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {51292#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:16,681 INFO L272 TraceCheckUtils]: 8: Hoare triple {51292#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {51302#(<= (+ |fibo2_#in~n| 4) oldRank0)} is VALID [2022-02-21 04:20:16,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {51302#(<= (+ |fibo2_#in~n| 4) oldRank0)} ~n := #in~n; {51306#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:16,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {51306#(<= (+ fibo2_~n 4) oldRank0)} assume !(~n < 1); {51306#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:16,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {51306#(<= (+ fibo2_~n 4) oldRank0)} assume !(1 == ~n); {51306#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:16,682 INFO L272 TraceCheckUtils]: 12: Hoare triple {51306#(<= (+ fibo2_~n 4) oldRank0)} call #t~ret6 := fibo1(~n - 1); {51316#(<= (+ 5 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:16,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {51316#(<= (+ 5 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {51320#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:16,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {51320#(<= (+ fibo1_~n 5) oldRank0)} assume !(~n < 1); {51320#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:16,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {51320#(<= (+ fibo1_~n 5) oldRank0)} assume !(1 == ~n); {51320#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:16,684 INFO L272 TraceCheckUtils]: 16: Hoare triple {51320#(<= (+ fibo1_~n 5) oldRank0)} call #t~ret4 := fibo2(~n - 1); {51330#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:16,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {51330#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {51334#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:16,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {51334#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {51338#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:16,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {51338#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {51338#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:16,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {51338#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {51338#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:16,686 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {51338#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {51320#(<= (+ fibo1_~n 5) oldRank0)} #50#return; {50881#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:16,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:16,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:16,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,725 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 12 loop predicates [2022-02-21 04:20:16,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 68 transitions. cyclomatic complexity: 3 Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:16,869 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 68 transitions. cyclomatic complexity: 3. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Result 73 states and 75 transitions. Complement of second has 11 states. [2022-02-21 04:20:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:16,869 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:16,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:16,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:16,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:16,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:16,870 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:16,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:16,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2022-02-21 04:20:16,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:16,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:16,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:16,870 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:16,871 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:16,871 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:16,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:16,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 21 transitions. cyclomatic complexity: 19 [2022-02-21 04:20:16,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:16,871 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:20:16,871 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 73 states and 75 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:16,871 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:16,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:20:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:20:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:20:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:20:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:20:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:20:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 75 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,876 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-21 04:20:16,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:16,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,877 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:17,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {50868#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {50868#unseeded} is VALID [2022-02-21 04:20:17,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {50868#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {50868#unseeded} is VALID [2022-02-21 04:20:17,208 INFO L272 TraceCheckUtils]: 2: Hoare triple {50868#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {50868#unseeded} is VALID [2022-02-21 04:20:17,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {50868#unseeded} ~n := #in~n; {50868#unseeded} is VALID [2022-02-21 04:20:17,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {50868#unseeded} assume !(~n < 1); {50868#unseeded} is VALID [2022-02-21 04:20:17,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {50868#unseeded} assume !(1 == ~n); {50868#unseeded} is VALID [2022-02-21 04:20:17,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {50868#unseeded} call #t~ret4 := fibo2(~n - 1); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,211 INFO L272 TraceCheckUtils]: 10: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,212 INFO L272 TraceCheckUtils]: 14: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,222 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,223 INFO L272 TraceCheckUtils]: 20: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,224 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,226 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,226 INFO L272 TraceCheckUtils]: 28: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,229 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,230 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {51462#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {50868#unseeded} #50#return; {50868#unseeded} is VALID [2022-02-21 04:20:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 04:20:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:17,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {50871#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {51553#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:17,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {51553#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {51557#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:17,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {51557#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {51557#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:17,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {51557#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {51557#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:17,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {51557#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {51567#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:17,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {51567#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {51571#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:17,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {51571#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {51571#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:17,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {51571#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {51571#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:17,549 INFO L272 TraceCheckUtils]: 8: Hoare triple {51571#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {51581#(<= (+ |fibo2_#in~n| 4) oldRank0)} is VALID [2022-02-21 04:20:17,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {51581#(<= (+ |fibo2_#in~n| 4) oldRank0)} ~n := #in~n; {51585#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:17,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {51585#(<= (+ fibo2_~n 4) oldRank0)} assume !(~n < 1); {51585#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:17,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {51585#(<= (+ fibo2_~n 4) oldRank0)} assume !(1 == ~n); {51585#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:17,550 INFO L272 TraceCheckUtils]: 12: Hoare triple {51585#(<= (+ fibo2_~n 4) oldRank0)} call #t~ret6 := fibo1(~n - 1); {51595#(<= (+ 5 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:17,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {51595#(<= (+ 5 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {51599#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:17,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {51599#(<= (+ fibo1_~n 5) oldRank0)} assume !(~n < 1); {51599#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:17,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {51599#(<= (+ fibo1_~n 5) oldRank0)} assume !(1 == ~n); {51599#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:17,552 INFO L272 TraceCheckUtils]: 16: Hoare triple {51599#(<= (+ fibo1_~n 5) oldRank0)} call #t~ret4 := fibo2(~n - 1); {51609#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:17,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {51609#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {51613#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:17,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {51613#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {51617#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:17,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {51617#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {51617#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:17,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {51617#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {51617#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:17,554 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {51617#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {51599#(<= (+ fibo1_~n 5) oldRank0)} #50#return; {50881#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:17,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:17,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:17,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:17,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,592 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2022-02-21 04:20:17,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 68 transitions. cyclomatic complexity: 3 Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:18,056 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 68 transitions. cyclomatic complexity: 3. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Result 192 states and 200 transitions. Complement of second has 91 states. [2022-02-21 04:20:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:18,056 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:18,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:18,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:18,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:18,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 200 transitions. [2022-02-21 04:20:18,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-02-21 04:20:18,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,059 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:18,059 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:18,059 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:18,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:18,060 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:18,060 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 192 states and 200 transitions. cyclomatic complexity: 11 [2022-02-21 04:20:18,060 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:18,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:18,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:18,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:18,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 192 letters. Loop has 192 letters. [2022-02-21 04:20:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 192 letters. Loop has 192 letters. [2022-02-21 04:20:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 192 letters. Loop has 192 letters. [2022-02-21 04:20:18,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:18,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:18,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:18,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:18,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:18,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:18,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:18,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:18,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:18,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:18,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:18,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:18,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:18,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:18,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 200 transitions. cyclomatic complexity: 11 Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:18,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,068 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2022-02-21 04:20:18,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,069 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:18,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {50868#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {50868#unseeded} is VALID [2022-02-21 04:20:18,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {50868#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 4; {50868#unseeded} is VALID [2022-02-21 04:20:18,455 INFO L272 TraceCheckUtils]: 2: Hoare triple {50868#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {50868#unseeded} is VALID [2022-02-21 04:20:18,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {50868#unseeded} ~n := #in~n; {50868#unseeded} is VALID [2022-02-21 04:20:18,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {50868#unseeded} assume !(~n < 1); {50868#unseeded} is VALID [2022-02-21 04:20:18,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {50868#unseeded} assume !(1 == ~n); {50868#unseeded} is VALID [2022-02-21 04:20:18,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {50868#unseeded} call #t~ret4 := fibo2(~n - 1); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,458 INFO L272 TraceCheckUtils]: 10: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,459 INFO L272 TraceCheckUtils]: 14: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,462 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,462 INFO L272 TraceCheckUtils]: 20: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,464 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,466 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,466 INFO L272 TraceCheckUtils]: 28: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,469 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,470 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {51950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {50868#unseeded} #50#return; {50868#unseeded} is VALID [2022-02-21 04:20:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 04:20:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:18,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {50871#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {52041#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:18,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {52041#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {52045#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:18,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {52045#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {52045#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:18,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {52045#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {52045#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:18,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {52045#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {52055#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:18,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {52055#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {52059#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:18,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {52059#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {52059#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:18,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {52059#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {52059#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:18,812 INFO L272 TraceCheckUtils]: 8: Hoare triple {52059#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {52069#(<= (+ |fibo2_#in~n| 4) oldRank0)} is VALID [2022-02-21 04:20:18,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {52069#(<= (+ |fibo2_#in~n| 4) oldRank0)} ~n := #in~n; {52073#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:18,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {52073#(<= (+ fibo2_~n 4) oldRank0)} assume !(~n < 1); {52073#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:18,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {52073#(<= (+ fibo2_~n 4) oldRank0)} assume !(1 == ~n); {52073#(<= (+ fibo2_~n 4) oldRank0)} is VALID [2022-02-21 04:20:18,813 INFO L272 TraceCheckUtils]: 12: Hoare triple {52073#(<= (+ fibo2_~n 4) oldRank0)} call #t~ret6 := fibo1(~n - 1); {52083#(<= (+ 5 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:18,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {52083#(<= (+ 5 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {52087#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:18,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {52087#(<= (+ fibo1_~n 5) oldRank0)} assume !(~n < 1); {52087#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:18,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {52087#(<= (+ fibo1_~n 5) oldRank0)} assume !(1 == ~n); {52087#(<= (+ fibo1_~n 5) oldRank0)} is VALID [2022-02-21 04:20:18,817 INFO L272 TraceCheckUtils]: 16: Hoare triple {52087#(<= (+ fibo1_~n 5) oldRank0)} call #t~ret4 := fibo2(~n - 1); {52097#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:18,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {52097#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {52101#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:18,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {52101#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {52105#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:18,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {52105#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {52105#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:18,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {52105#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {52105#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:18,820 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {52105#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {52087#(<= (+ fibo1_~n 5) oldRank0)} #50#return; {50881#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:18,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:18,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:18,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,857 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 12 loop predicates [2022-02-21 04:20:18,857 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 68 transitions. cyclomatic complexity: 3 Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:19,410 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 68 transitions. cyclomatic complexity: 3. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Result 107 states and 112 transitions. Complement of second has 35 states. [2022-02-21 04:20:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:19,410 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:19,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:19,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:19,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:19,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:19,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-02-21 04:20:19,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:19,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:19,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 112 transitions. [2022-02-21 04:20:19,411 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:19,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:19,412 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:19,412 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:19,412 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:19,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-02-21 04:20:19,412 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:19,412 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 107 states and 112 transitions. cyclomatic complexity: 7 [2022-02-21 04:20:19,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 112 transitions. cyclomatic complexity: 7 [2022-02-21 04:20:19,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:19,412 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:20:19,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 112 transitions. cyclomatic complexity: 7 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 112 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 107 letters. Loop has 107 letters. [2022-02-21 04:20:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 107 letters. Loop has 107 letters. [2022-02-21 04:20:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 112 transitions. cyclomatic complexity: 7 Stem has 107 letters. Loop has 107 letters. [2022-02-21 04:20:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 112 transitions. cyclomatic complexity: 7 Stem has 66 letters. Loop has 66 letters. [2022-02-21 04:20:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:20:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:20:19,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 112 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:20:19,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 112 transitions. cyclomatic complexity: 7 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 112 transitions. cyclomatic complexity: 7 Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 68 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:19,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:19,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 107 states and 112 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:19,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,418 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 8 states have internal predecessors, (34), 7 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:20:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-02-21 04:20:19,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:19,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 37 letters. Loop has 44 letters. [2022-02-21 04:20:19,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 112 transitions. cyclomatic complexity: 7 [2022-02-21 04:20:19,421 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:19,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 0 states and 0 transitions. [2022-02-21 04:20:19,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:20:19,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:20:19,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:20:19,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:20:19,422 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:19,422 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:19,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:19,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 04:20:19,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-02-21 04:20:19,423 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 24 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 16 states have internal predecessors, (54), 12 states have call successors, (20), 10 states have call predecessors, (20), 2 states have return successors, (9), 4 states have call predecessors, (9), 6 states have call successors, (9) [2022-02-21 04:20:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:19,423 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:20:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:20:19,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 16 states have internal predecessors, (54), 12 states have call successors, (20), 10 states have call predecessors, (20), 2 states have return successors, (9), 4 states have call predecessors, (9), 6 states have call successors, (9) [2022-02-21 04:20:19,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:19,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:20:19,478 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:19,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:20:19,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:20:19,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:20:19,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:20:19,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:20:19,478 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:19,478 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:19,478 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:19,478 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:20:19,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:20:19,478 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:19,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:19,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:20:19 BoogieIcfgContainer [2022-02-21 04:20:19,495 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:20:19,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:20:19,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:20:19,495 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:20:19,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:42" (3/4) ... [2022-02-21 04:20:19,497 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:20:19,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:20:19,498 INFO L158 Benchmark]: Toolchain (without parser) took 36982.91ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 94.8MB in the beginning and 179.2MB in the end (delta: -84.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-21 04:20:19,499 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 43.0MB in the beginning and 42.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:20:19,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.40ms. Allocated memory is still 123.7MB. Free memory was 94.4MB in the beginning and 98.9MB in the end (delta: -4.5MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-02-21 04:20:19,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.82ms. Allocated memory is still 123.7MB. Free memory was 98.9MB in the beginning and 97.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:20:19,500 INFO L158 Benchmark]: Boogie Preprocessor took 21.63ms. Allocated memory is still 123.7MB. Free memory was 97.6MB in the beginning and 96.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:20:19,500 INFO L158 Benchmark]: RCFGBuilder took 197.10ms. Allocated memory is still 123.7MB. Free memory was 96.5MB in the beginning and 86.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:20:19,500 INFO L158 Benchmark]: BuchiAutomizer took 36568.42ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 86.8MB in the beginning and 179.2MB in the end (delta: -92.4MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2022-02-21 04:20:19,500 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 218.1MB. Free memory was 179.2MB in the beginning and 179.2MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:20:19,501 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.16ms. Allocated memory is still 79.7MB. Free memory was 43.0MB in the beginning and 42.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.40ms. Allocated memory is still 123.7MB. Free memory was 94.4MB in the beginning and 98.9MB in the end (delta: -4.5MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.82ms. Allocated memory is still 123.7MB. Free memory was 98.9MB in the beginning and 97.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.63ms. Allocated memory is still 123.7MB. Free memory was 97.6MB in the beginning and 96.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 197.10ms. Allocated memory is still 123.7MB. Free memory was 96.5MB in the beginning and 86.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 36568.42ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 86.8MB in the beginning and 179.2MB in the end (delta: -92.4MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 218.1MB. Free memory was 179.2MB in the beginning and 179.2MB in the end (delta: 2.6kB). There was no memory consumed. 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 14 terminating modules (8 trivial, 3 deterministic, 3 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 12 locations. One deterministic module has affine ranking function n and consists of 13 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 12 locations. One nondeterministic module has affine ranking function n and consists of 14 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 36.5s and 10 iterations. TraceHistogramMax:8. Analysis of lassos took 17.4s. Construction of modules took 2.9s. Büchi inclusion checks took 13.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 12. Automata minimization 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 516 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 482 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/33 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1030 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1003 mSDsluCounter, 1447 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 985 mSDsCounter, 583 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2511 IncrementalHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 583 mSolverCounterUnsat, 462 mSDtfsCounter, 2511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT1 SILN0 SILU0 SILI2 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp89 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf93 smp82 dnf100 smp100 tf109 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 33 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:20:19,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:19,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:19,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:20,138 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 04:20:20,338 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 04:20:20,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:20,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-02-21 04:20:20,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:21,141 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 Result: TRUE