./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.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-2.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 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:19:42,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:19:42,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:19:42,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:19:42,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:19:42,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:19:42,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:19:42,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:19:42,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:19:42,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:19:42,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:19:42,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:19:42,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:19:42,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:19:42,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:19:42,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:19:42,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:19:42,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:19:42,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:19:42,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:19:42,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:19:42,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:19:42,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:19:42,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:19:42,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:19:42,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:19:42,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:19:42,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:19:42,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:19:42,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:19:42,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:19:42,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:19:42,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:19:42,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:19:42,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:19:42,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:19:42,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:19:42,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:19:42,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:19:42,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:19:42,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:19:42,718 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:42,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:19:42,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:19:42,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:19:42,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:19:42,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:19:42,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:19:42,735 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:19:42,735 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:19:42,735 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:19:42,735 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:19:42,736 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:19:42,736 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:19:42,736 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:19:42,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:19:42,736 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:19:42,736 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:19:42,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:19:42,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:19:42,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:19:42,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:19:42,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:19:42,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:19:42,738 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:19:42,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:19:42,738 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:19:42,738 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:19:42,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:19:42,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:19:42,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:19:42,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:19:42,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:19:42,740 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:19:42,740 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 -> 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f [2022-02-21 04:19:42,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:19:42,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:19:42,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:19:42,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:19:42,928 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:19:42,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c [2022-02-21 04:19:42,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39adfa49b/fa2d70ec0f7d477595b22d0b01b8533a/FLAG435b2f9c1 [2022-02-21 04:19:43,356 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:19:43,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c [2022-02-21 04:19:43,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39adfa49b/fa2d70ec0f7d477595b22d0b01b8533a/FLAG435b2f9c1 [2022-02-21 04:19:43,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39adfa49b/fa2d70ec0f7d477595b22d0b01b8533a [2022-02-21 04:19:43,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:19:43,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:19:43,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:43,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:19:43,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:19:43,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:43" (1/1) ... [2022-02-21 04:19:43,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9355fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:43, skipping insertion in model container [2022-02-21 04:19:43,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:43" (1/1) ... [2022-02-21 04:19:43,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:19:43,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:19:43,964 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-2.c[946,959] [2022-02-21 04:19:43,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:43,972 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:19:43,998 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-2.c[946,959] [2022-02-21 04:19:43,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:44,018 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:19:44,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:44 WrapperNode [2022-02-21 04:19:44,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:44,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:44,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:19:44,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:19:44,025 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:44" (1/1) ... [2022-02-21 04:19:44,029 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:44" (1/1) ... [2022-02-21 04:19:44,043 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 04:19:44,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:44,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:19:44,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:19:44,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:19:44,050 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:44" (1/1) ... [2022-02-21 04:19:44,051 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:44" (1/1) ... [2022-02-21 04:19:44,052 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:44" (1/1) ... [2022-02-21 04:19:44,052 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:44" (1/1) ... [2022-02-21 04:19:44,057 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:44" (1/1) ... [2022-02-21 04:19:44,059 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:44" (1/1) ... [2022-02-21 04:19:44,064 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:44" (1/1) ... [2022-02-21 04:19:44,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:19:44,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:19:44,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:19:44,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:19:44,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:44" (1/1) ... [2022-02-21 04:19:44,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,093 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:44,102 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:44,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:19:44,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:19:44,126 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-02-21 04:19:44,126 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-02-21 04:19:44,126 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-02-21 04:19:44,126 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-02-21 04:19:44,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:19:44,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:19:44,165 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:19:44,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:19:44,246 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:19:44,251 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:19:44,252 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 04:19:44,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:44 BoogieIcfgContainer [2022-02-21 04:19:44,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:19:44,254 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:19:44,254 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:19:44,257 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:19:44,257 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:44,257 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:19:43" (1/3) ... [2022-02-21 04:19:44,258 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73825e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:44, skipping insertion in model container [2022-02-21 04:19:44,258 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:44,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:44" (2/3) ... [2022-02-21 04:19:44,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73825e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:44, skipping insertion in model container [2022-02-21 04:19:44,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:44,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:44" (3/3) ... [2022-02-21 04:19:44,260 INFO L388 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_4-2.c [2022-02-21 04:19:44,290 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:19:44,291 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:19:44,291 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:19:44,291 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:19:44,291 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:19:44,291 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:19:44,291 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:19:44,291 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:19:44,304 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:44,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:44,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:44,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:44,327 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 04:19:44,328 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:44,328 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:19:44,328 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:44,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:44,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:44,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:44,336 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 04:19:44,336 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:44,340 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:44,341 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:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:44,345 INFO L85 PathProgramCache]: Analyzing trace with hash 29896, now seen corresponding path program 1 times [2022-02-21 04:19:44,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:44,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082388636] [2022-02-21 04:19:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:44,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:44,434 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:44,452 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:44,454 INFO L85 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 1 times [2022-02-21 04:19:44,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:44,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563409858] [2022-02-21 04:19:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:44,476 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:44,483 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1313669423, now seen corresponding path program 1 times [2022-02-21 04:19:44,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:44,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188798614] [2022-02-21 04:19:44,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:44,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:44,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:44,535 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:44,846 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:44,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:44,846 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:44,846 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:44,847 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:44,847 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,847 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:44,847 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:44,847 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration1_Loop [2022-02-21 04:19:44,847 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:44,847 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:44,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:44,861 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,864 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,866 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,868 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,870 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,872 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,874 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,876 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,882 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,958 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:44,959 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:44,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:44,962 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:44,963 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:44,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:44,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:44,989 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:44,989 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:45,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:45,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,010 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:45,010 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:45,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:45,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:45,046 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:45,047 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:45,062 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:45,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,064 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:45,065 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:45,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:45,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:45,093 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:45,093 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:45,111 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:45,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,114 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:45,118 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:45,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:45,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:45,166 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:45,166 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:45,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:45,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,184 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:45,185 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:45,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:45,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:45,208 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:45,208 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:45,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:45,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,227 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:45,228 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:45,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:45,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:45,251 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:45,251 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:45,268 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:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,270 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:45,271 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:45,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:45,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:45,278 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:45,279 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:45,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:45,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,295 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:45,297 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:45,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:45,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:45,318 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:45,318 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:45,336 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:45,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,337 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:45,338 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:45,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:45,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:45,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:45,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,369 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:45,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:45,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:45,378 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:45,452 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:45,456 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:45,456 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:45,456 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:45,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:45,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:45,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:45,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,456 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:45,456 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:45,457 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration1_Loop [2022-02-21 04:19:45,457 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:45,457 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:45,467 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:45,471 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:45,486 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:45,488 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:45,491 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:45,493 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:45,495 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:45,501 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:45,503 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:45,506 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:45,624 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:45,635 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:45,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,652 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:45,672 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:45,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:45,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:45,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:45,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:45,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:45,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:45,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:45,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:45,698 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:45,726 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:45,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,729 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:45,730 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:45,730 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:45,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:45,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:45,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:45,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:45,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:45,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:45,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:45,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:45,759 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:45,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,761 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:45,762 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:45,781 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:45,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:45,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:45,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:45,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:45,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:45,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:45,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:45,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:45,807 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:45,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,809 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:45,810 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:45,811 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:45,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:45,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:45,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:45,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:45,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:45,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:45,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:45,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:45,851 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:45,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,853 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:45,854 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:45,855 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:45,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:45,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:45,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:45,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:45,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:45,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:45,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:45,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:45,881 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:45,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,883 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:45,884 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:45,885 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:45,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:45,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:45,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:45,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:45,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:45,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:45,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:45,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:45,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:45,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,942 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:45,943 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:45,945 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:45,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:45,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:45,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:45,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:45,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:45,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:45,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:45,957 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:45,963 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:45,963 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:45,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:45,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:45,967 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:45,968 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:46,003 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:46,004 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:46,004 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:46,004 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2022-02-21 04:19:46,023 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:46,030 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:46,034 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:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:46,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:19:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:46,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:46,087 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:46,088 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:46,088 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:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:46,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:46,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:46,261 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:46,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(<= fibo1_~n oldRank0)} assume !(~n < 1); {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:46,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#(<= fibo1_~n oldRank0)} assume !(1 == ~n); {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:46,262 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:46,263 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:46,263 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:46,264 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:46,265 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:46,265 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:46,302 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:46,318 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:46,319 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:46,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,324 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:46,325 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:46,411 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:46,619 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:46,619 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:46,619 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:46,620 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:46,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:46,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:46,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:46,623 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:46,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:46,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:46,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:46,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 116 transitions. [2022-02-21 04:19:46,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:46,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:46,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:46,631 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:46,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:46,636 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:19:46,636 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:46,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:46,637 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:46,637 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 116 transitions. cyclomatic complexity: 34 [2022-02-21 04:19:46,646 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:19:46,646 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:46,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,647 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:46,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,647 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:46,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,647 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:46,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,648 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:46,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,648 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:46,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,648 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:46,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,648 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:46,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,649 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:46,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,649 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:46,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,649 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:46,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,650 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:46,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,650 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:46,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,650 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:46,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,650 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:46,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,651 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:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,651 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:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,651 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:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,651 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:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,651 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:46,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,652 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:46,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,652 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:46,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,652 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:46,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,652 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:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,653 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:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,653 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:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,653 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:46,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,654 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:46,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,654 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:46,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,654 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:46,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,655 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:46,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,655 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:46,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,655 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:46,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,655 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:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,656 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:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,656 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:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,656 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:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,656 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:46,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,657 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:46,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,657 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:46,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,657 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:46,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,658 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:46,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,658 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:46,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,658 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:46,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,658 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:46,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,659 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:46,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,659 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:46,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,659 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:46,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,659 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:46,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,660 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:46,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,660 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:46,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,660 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:46,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,660 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:46,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,661 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:46,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,661 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:46,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,661 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:46,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,661 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:46,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,662 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:46,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,662 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:46,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,662 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:46,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,662 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:46,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,663 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:46,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,663 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:46,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,663 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:46,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,663 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:46,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,664 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:46,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,664 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:46,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,666 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:46,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,666 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:46,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,666 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:46,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,667 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:46,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,667 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:46,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,667 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:46,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,667 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:46,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,667 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:46,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,668 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:46,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,668 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:46,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,668 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:46,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,668 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:46,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,668 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:46,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,669 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:46,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,669 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:46,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,669 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:46,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,669 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:46,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,669 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:46,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,670 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:46,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,670 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:46,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,670 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:46,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,670 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:46,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,670 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:46,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,671 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:46,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,671 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:46,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,671 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:46,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,672 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:46,675 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:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-02-21 04:19:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:19:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 16 letters. [2022-02-21 04:19:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:46,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. cyclomatic complexity: 34 [2022-02-21 04:19:46,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:46,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 82 transitions. [2022-02-21 04:19:46,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 04:19:46,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-02-21 04:19:46,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2022-02-21 04:19:46,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:46,703 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2022-02-21 04:19:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2022-02-21 04:19:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2022-02-21 04:19:46,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:46,724 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:46,724 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:46,726 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:46,728 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:46,736 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2022-02-21 04:19:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2022-02-21 04:19:46,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:46,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:46,738 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:46,738 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:46,739 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:46,760 INFO L93 Difference]: Finished difference Result 128 states and 169 transitions. [2022-02-21 04:19:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2022-02-21 04:19:46,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:46,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:46,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:46,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:46,763 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:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2022-02-21 04:19:46,765 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-02-21 04:19:46,765 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-02-21 04:19:46,765 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:19:46,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2022-02-21 04:19:46,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:46,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:46,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:46,770 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:46,770 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:46,770 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:46,770 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:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1888024054, now seen corresponding path program 1 times [2022-02-21 04:19:46,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:46,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729911798] [2022-02-21 04:19:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:46,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:19:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:46,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {743#true} ~n := #in~n; {751#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:46,890 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:46,890 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:46,891 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:46,892 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:46,892 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:46,892 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:46,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {743#true} ~n := #in~n; {743#true} is VALID [2022-02-21 04:19:46,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {743#true} assume !(~n < 1); {743#true} is VALID [2022-02-21 04:19:46,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} assume !(1 == ~n); {743#true} is VALID [2022-02-21 04:19:46,892 INFO L272 TraceCheckUtils]: 6: Hoare triple {743#true} call #t~ret4 := fibo2(~n - 1); {743#true} is VALID [2022-02-21 04:19:46,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {743#true} ~n := #in~n; {743#true} is VALID [2022-02-21 04:19:46,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {743#true} assume !(~n < 1); {745#(< 0 fibo2_~n)} is VALID [2022-02-21 04:19:46,893 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:46,893 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:46,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {743#true} ~n := #in~n; {751#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:46,894 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:46,895 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:46,895 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:46,896 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:46,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:46,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729911798] [2022-02-21 04:19:46,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729911798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:46,896 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:46,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:46,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209454852] [2022-02-21 04:19:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:46,899 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:46,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1730504828, now seen corresponding path program 1 times [2022-02-21 04:19:46,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:46,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693689572] [2022-02-21 04:19:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:46,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:46,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:19:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:46,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#true} ~n := #in~n; {761#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:46,938 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:46,938 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:46,939 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:46,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {753#true} call #t~ret7 := fibo1(~n - 2); {753#true} is VALID [2022-02-21 04:19:46,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} ~n := #in~n; {753#true} is VALID [2022-02-21 04:19:46,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#true} assume !(~n < 1); {753#true} is VALID [2022-02-21 04:19:46,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#true} assume !(1 == ~n); {753#true} is VALID [2022-02-21 04:19:46,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {753#true} call #t~ret4 := fibo2(~n - 1); {753#true} is VALID [2022-02-21 04:19:46,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#true} ~n := #in~n; {753#true} is VALID [2022-02-21 04:19:46,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {753#true} assume !(~n < 1); {755#(< 0 fibo2_~n)} is VALID [2022-02-21 04:19:46,941 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:46,941 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:46,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#true} ~n := #in~n; {761#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:46,942 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:46,942 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:46,943 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:46,943 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:46,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:46,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693689572] [2022-02-21 04:19:46,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693689572] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:46,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:46,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:46,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654972674] [2022-02-21 04:19:46,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:46,944 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:19:46,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:46,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:19:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:19:46,946 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:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:47,083 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2022-02-21 04:19:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:19:47,083 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:47,095 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:47,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2022-02-21 04:19:47,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:47,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 86 transitions. [2022-02-21 04:19:47,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-02-21 04:19:47,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 04:19:47,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2022-02-21 04:19:47,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:47,114 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2022-02-21 04:19:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2022-02-21 04:19:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2022-02-21 04:19:47,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:47,123 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:47,123 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:47,124 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:47,125 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:47,138 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-02-21 04:19:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-02-21 04:19:47,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:47,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:47,145 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:47,145 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:47,146 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:47,154 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-02-21 04:19:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-02-21 04:19:47,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:47,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:47,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:47,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:47,156 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:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-02-21 04:19:47,159 INFO L704 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-21 04:19:47,159 INFO L587 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-21 04:19:47,159 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:19:47,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. [2022-02-21 04:19:47,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:47,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:47,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:47,161 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:47,161 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:47,162 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:47,162 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:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1600771562, now seen corresponding path program 1 times [2022-02-21 04:19:47,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:47,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65671127] [2022-02-21 04:19:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:47,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:19:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:47,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} ~n := #in~n; {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:47,265 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:47,268 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:47,269 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:47,270 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:47,270 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:47,270 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:47,271 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:47,273 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:47,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(~n < 1); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:47,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(1 == ~n); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:47,275 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:47,275 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:47,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(~n < 1); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:47,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(1 == ~n); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:47,276 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:47,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:47,277 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:47,277 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:47,277 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:47,278 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:47,278 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:47,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:47,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65671127] [2022-02-21 04:19:47,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65671127] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:47,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179191406] [2022-02-21 04:19:47,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:47,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:47,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,281 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:47,333 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:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:47,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:47,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:47,468 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:47,468 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:47,469 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:47,469 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:47,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(~n < 1); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:47,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(1 == ~n); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:47,471 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:47,471 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:47,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(~n < 1); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:47,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(1 == ~n); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:47,472 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:47,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1446#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:47,473 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:47,473 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:47,473 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:47,474 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:47,475 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:47,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:47,682 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:47,683 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:47,683 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:47,683 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:47,684 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:47,684 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:47,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(1 == ~n); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:47,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 3 fibo2_~n)} assume !(~n < 1); {1402#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:47,686 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:47,686 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:47,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(1 == ~n); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:47,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 4 fibo1_~n)} assume !(~n < 1); {1400#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:47,687 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:47,688 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:47,688 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:47,688 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:47,688 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:47,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179191406] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:47,689 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:47,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-02-21 04:19:47,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269099045] [2022-02-21 04:19:47,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:47,690 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:47,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:47,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2106067024, now seen corresponding path program 1 times [2022-02-21 04:19:47,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:47,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463310589] [2022-02-21 04:19:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:47,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:47,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:47,700 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:47,902 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:47,902 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:47,902 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:47,902 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:47,902 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:47,902 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,902 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:47,902 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:47,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration3_Loop [2022-02-21 04:19:47,903 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:47,903 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:47,903 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:47,905 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:47,906 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:47,908 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:47,910 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:47,911 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:47,913 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:47,915 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:47,920 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,003 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:48,004 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:48,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,006 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:48,007 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:48,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,015 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:48,015 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:48,031 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:48,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,033 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:48,034 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:48,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,042 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:48,042 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:48,060 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:48,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,062 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:48,063 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:48,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,085 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:48,085 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:48,101 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:48,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,102 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:48,103 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:48,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,111 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:48,111 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:48,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 04:19:48,128 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,131 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:48,132 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:48,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,139 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:48,139 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:48,156 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:48,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,188 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:48,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,213 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:48,221 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:48,222 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:48,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:48,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,251 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:48,252 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:48,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,268 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:48,268 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:48,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:48,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,287 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:48,289 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:48,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:48,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,319 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:48,320 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:48,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:48,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:49,209 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:49,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:49,213 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:49,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:49,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:49,213 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:49,213 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:49,213 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:49,213 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:49,213 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:49,213 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration3_Loop [2022-02-21 04:19:49,213 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:49,213 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:49,214 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:49,225 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:49,228 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:49,230 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:49,232 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:49,234 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:49,236 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:49,241 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:49,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:49,342 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:49,342 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,344 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:49,344 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:49,346 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:49,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:49,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:49,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:49,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:49,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:49,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:49,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:49,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:49,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:19:49,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:49,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,375 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:49,376 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:49,376 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:49,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:49,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:49,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:49,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:49,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:49,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:49,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:49,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:49,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 04:19:49,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:49,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,414 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:49,415 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:49,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:19:49,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:49,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:49,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:49,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:49,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:49,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:49,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:49,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:49,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:49,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:49,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,446 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:49,446 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:49,448 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:49,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:49,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:49,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:49,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:49,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:49,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:49,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:49,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:49,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:49,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:49,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,493 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:49,494 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:49,496 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:49,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:49,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:49,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:49,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:49,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:49,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:49,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:49,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:49,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:49,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:49,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,535 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:49,538 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:49,542 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:49,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:49,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:49,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:49,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:49,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:49,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:49,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:49,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:49,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,575 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:49,577 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:49,577 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:49,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:49,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:49,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:49,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:49,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:49,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:49,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:49,586 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:49,587 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:49,587 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:49,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,589 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:49,590 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:49,590 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:49,590 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:49,590 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:49,591 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2022-02-21 04:19:49,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:49,620 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:49,624 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:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,658 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,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:49,800 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:49,801 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:49,801 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:49,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {1504#unseeded} ~n := #in~n; {1504#unseeded} is VALID [2022-02-21 04:19:49,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {1504#unseeded} assume !(~n < 1); {1504#unseeded} is VALID [2022-02-21 04:19:49,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#unseeded} assume !(1 == ~n); {1504#unseeded} is VALID [2022-02-21 04:19:49,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#unseeded} call #t~ret4 := fibo2(~n - 1); {1504#unseeded} is VALID [2022-02-21 04:19:49,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#unseeded} ~n := #in~n; {1504#unseeded} is VALID [2022-02-21 04:19:49,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#unseeded} assume !(~n < 1); {1504#unseeded} is VALID [2022-02-21 04:19:49,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#unseeded} assume !(1 == ~n); {1504#unseeded} is VALID [2022-02-21 04:19:49,807 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:49,808 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:49,809 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:49,809 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:49,811 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:49,811 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:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:19:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:50,097 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:50,097 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:50,099 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:50,099 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:50,110 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:50,110 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:50,111 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:50,111 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:50,112 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:50,112 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:50,113 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:50,113 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:50,114 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:50,114 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:50,115 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:50,115 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:50,137 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:50,137 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:50,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,138 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:50,139 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:50,931 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:50,931 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:50,931 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:50,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. cyclomatic complexity: 20 [2022-02-21 04:19:50,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:50,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:50,932 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:50,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:19:50,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:50,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:50,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 263 transitions. [2022-02-21 04:19:50,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:50,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:50,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:50,938 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 76 transitions. cyclomatic complexity: 20 [2022-02-21 04:19:50,944 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 04:19:50,944 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:50,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:19:50,947 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:50,947 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 191 states and 263 transitions. cyclomatic complexity: 77 [2022-02-21 04:19:50,954 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:50,954 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:50,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,954 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:50,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,955 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:50,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,955 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:50,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,956 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:50,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,956 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:50,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,956 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:50,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,956 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:50,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,957 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:50,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,957 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:50,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,971 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:50,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,972 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:50,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,972 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:50,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,972 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:50,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,972 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:50,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,973 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:50,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,973 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:50,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,973 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:50,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,973 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:50,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,974 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:50,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,974 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:50,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,974 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:50,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,974 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:50,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,975 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:50,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,975 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:50,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,975 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:50,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,976 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:50,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,976 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:50,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,976 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:50,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,977 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:50,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,977 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:50,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,977 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:50,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,978 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:50,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,978 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:50,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,978 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:50,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,979 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:50,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,979 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:50,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,979 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:50,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,979 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:50,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,980 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:50,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,980 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:50,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,980 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:50,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,981 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:50,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,981 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:50,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,981 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:50,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,982 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:50,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,982 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:50,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,982 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:50,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,982 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:50,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,983 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:50,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,983 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:50,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,983 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:50,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,983 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:50,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,984 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:50,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,984 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:50,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,984 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:50,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,995 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:50,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,996 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:50,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,996 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:50,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,996 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:50,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,997 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:50,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,997 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:50,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,997 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:50,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,997 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:50,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,998 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:50,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,998 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:50,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,998 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:50,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,998 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:50,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,999 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:50,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,999 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:50,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,999 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:50,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:50,999 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:50,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,000 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:51,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,000 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:51,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,000 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:51,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,000 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:51,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,001 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:51,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,001 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:51,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,001 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:51,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,001 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:51,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,002 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:51,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,002 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:51,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,002 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:51,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,002 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:51,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,003 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:51,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,003 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:51,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,003 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:51,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,003 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:51,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,004 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:51,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,004 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:51,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,004 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:51,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,004 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:51,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,004 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:51,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,005 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:51,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,005 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:51,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,005 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:51,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,005 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:51,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,006 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:51,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,006 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:51,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,006 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:51,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,007 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:51,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,007 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:51,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,008 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:51,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,008 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:51,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,008 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:51,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,008 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:51,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,009 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:51,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,009 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:51,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,009 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:51,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,009 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:51,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,010 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:51,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,010 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:51,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,010 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:51,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,010 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:51,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,011 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:51,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,011 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:51,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,011 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:51,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,011 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:51,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,012 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:51,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,012 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:51,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,012 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:51,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,013 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:51,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,027 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:51,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,028 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:51,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,028 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:51,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,028 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:51,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,028 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:51,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,029 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:51,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,029 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:51,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,029 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:51,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,029 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:51,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,030 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:51,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,030 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:51,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,030 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:51,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,031 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:51,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,031 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:51,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,031 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:51,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,031 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:51,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,032 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:51,032 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:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-02-21 04:19:51,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:51,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 30 letters. Loop has 14 letters. [2022-02-21 04:19:51,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 16 letters. Loop has 28 letters. [2022-02-21 04:19:51,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:51,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 263 transitions. cyclomatic complexity: 77 [2022-02-21 04:19:51,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:51,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 169 states and 237 transitions. [2022-02-21 04:19:51,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2022-02-21 04:19:51,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2022-02-21 04:19:51,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 237 transitions. [2022-02-21 04:19:51,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:51,051 INFO L681 BuchiCegarLoop]: Abstraction has 169 states and 237 transitions. [2022-02-21 04:19:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 237 transitions. [2022-02-21 04:19:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2022-02-21 04:19:51,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:51,068 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:51,068 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:51,068 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:51,069 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:51,084 INFO L93 Difference]: Finished difference Result 364 states and 492 transitions. [2022-02-21 04:19:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2022-02-21 04:19:51,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:51,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:51,087 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:51,087 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:51,088 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:51,121 INFO L93 Difference]: Finished difference Result 390 states and 526 transitions. [2022-02-21 04:19:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 526 transitions. [2022-02-21 04:19:51,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:51,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:51,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:51,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:51,123 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:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2022-02-21 04:19:51,128 INFO L704 BuchiCegarLoop]: Abstraction has 152 states and 206 transitions. [2022-02-21 04:19:51,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 04:19:51,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-21 04:19:51,129 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:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:51,398 INFO L93 Difference]: Finished difference Result 183 states and 247 transitions. [2022-02-21 04:19:51,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:19:51,398 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:51,413 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:51,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 247 transitions. [2022-02-21 04:19:51,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:51,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 180 states and 243 transitions. [2022-02-21 04:19:51,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-02-21 04:19:51,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-02-21 04:19:51,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 243 transitions. [2022-02-21 04:19:51,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:51,431 INFO L681 BuchiCegarLoop]: Abstraction has 180 states and 243 transitions. [2022-02-21 04:19:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 243 transitions. [2022-02-21 04:19:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2022-02-21 04:19:51,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:51,454 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:51,454 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:51,455 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:51,455 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:51,509 INFO L93 Difference]: Finished difference Result 401 states and 555 transitions. [2022-02-21 04:19:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 555 transitions. [2022-02-21 04:19:51,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:51,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:51,525 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:51,525 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:51,526 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:51,562 INFO L93 Difference]: Finished difference Result 401 states and 555 transitions. [2022-02-21 04:19:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 555 transitions. [2022-02-21 04:19:51,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:51,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:51,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:51,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:51,564 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:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 225 transitions. [2022-02-21 04:19:51,580 INFO L704 BuchiCegarLoop]: Abstraction has 165 states and 225 transitions. [2022-02-21 04:19:51,581 INFO L587 BuchiCegarLoop]: Abstraction has 165 states and 225 transitions. [2022-02-21 04:19:51,581 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:19:51,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 225 transitions. [2022-02-21 04:19:51,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:51,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:51,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:51,582 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:51,582 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:51,583 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:51,583 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:51,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash 613030308, now seen corresponding path program 1 times [2022-02-21 04:19:51,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:51,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757356661] [2022-02-21 04:19:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-21 04:19:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5119#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:51,660 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:51,660 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:51,661 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:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:19:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:51,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:51,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5059#true} {5060#false} #52#return; {5060#false} is VALID [2022-02-21 04:19:51,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume !(~n < 1); {5109#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:51,667 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:51,667 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:51,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {5059#true} ~n := #in~n; {5119#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:51,667 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:51,668 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:51,668 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:51,669 INFO L272 TraceCheckUtils]: 8: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5059#true} is VALID [2022-02-21 04:19:51,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:51,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:51,669 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5059#true} {5060#false} #52#return; {5060#false} is VALID [2022-02-21 04:19:51,669 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:51,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:51,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5060#false} {5059#true} #46#return; {5060#false} is VALID [2022-02-21 04:19:51,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 04:19:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:51,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:51,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5059#true} {5060#false} #48#return; {5060#false} is VALID [2022-02-21 04:19:51,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#true} assume !(~n < 1); {5059#true} is VALID [2022-02-21 04:19:51,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {5059#true} assume !(1 == ~n); {5059#true} is VALID [2022-02-21 04:19:51,675 INFO L272 TraceCheckUtils]: 3: Hoare triple {5059#true} call #t~ret6 := fibo1(~n - 1); {5059#true} is VALID [2022-02-21 04:19:51,675 INFO L290 TraceCheckUtils]: 4: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {5059#true} assume !(~n < 1); {5109#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:51,676 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:51,676 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:51,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {5059#true} ~n := #in~n; {5119#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:51,677 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:51,677 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:51,678 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:51,678 INFO L272 TraceCheckUtils]: 12: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5059#true} is VALID [2022-02-21 04:19:51,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:51,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:51,678 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5059#true} {5060#false} #52#return; {5060#false} is VALID [2022-02-21 04:19:51,679 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:51,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:51,679 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5060#false} {5059#true} #46#return; {5060#false} is VALID [2022-02-21 04:19:51,679 INFO L272 TraceCheckUtils]: 20: Hoare triple {5060#false} call #t~ret7 := fibo1(~n - 2); {5059#true} is VALID [2022-02-21 04:19:51,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:51,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:51,680 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5059#true} {5060#false} #48#return; {5060#false} is VALID [2022-02-21 04:19:51,680 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:51,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:51,680 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5060#false} {5059#true} #50#return; {5060#false} is VALID [2022-02-21 04:19:51,680 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,680 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:51,680 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:51,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {5059#true} assume !(~n < 1); {5059#true} is VALID [2022-02-21 04:19:51,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {5059#true} assume !(1 == ~n); {5059#true} is VALID [2022-02-21 04:19:51,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {5059#true} call #t~ret4 := fibo2(~n - 1); {5059#true} is VALID [2022-02-21 04:19:51,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {5059#true} assume !(~n < 1); {5059#true} is VALID [2022-02-21 04:19:51,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {5059#true} assume !(1 == ~n); {5059#true} is VALID [2022-02-21 04:19:51,682 INFO L272 TraceCheckUtils]: 10: Hoare triple {5059#true} call #t~ret6 := fibo1(~n - 1); {5059#true} is VALID [2022-02-21 04:19:51,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {5059#true} assume !(~n < 1); {5109#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:51,683 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:51,683 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:51,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {5059#true} ~n := #in~n; {5119#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:51,683 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:51,684 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,684 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:51,685 INFO L272 TraceCheckUtils]: 19: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5059#true} is VALID [2022-02-21 04:19:51,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:51,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:51,685 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5059#true} {5060#false} #52#return; {5060#false} is VALID [2022-02-21 04:19:51,685 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:51,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:51,686 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5060#false} {5059#true} #46#return; {5060#false} is VALID [2022-02-21 04:19:51,686 INFO L272 TraceCheckUtils]: 27: Hoare triple {5060#false} call #t~ret7 := fibo1(~n - 2); {5059#true} is VALID [2022-02-21 04:19:51,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:51,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:51,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:51,686 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5059#true} {5060#false} #48#return; {5060#false} is VALID [2022-02-21 04:19:51,686 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:51,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {5060#false} assume true; {5060#false} is VALID [2022-02-21 04:19:51,687 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5060#false} {5059#true} #50#return; {5060#false} is VALID [2022-02-21 04:19:51,687 INFO L272 TraceCheckUtils]: 35: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5060#false} is VALID [2022-02-21 04:19:51,687 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:51,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:51,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757356661] [2022-02-21 04:19:51,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757356661] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:51,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158578648] [2022-02-21 04:19:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:51,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,689 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:51,690 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:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:19:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:51,993 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,995 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,995 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,996 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,996 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,996 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,996 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,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {5059#true} ~n := #in~n; {5148#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:51,997 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:51,997 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:51,997 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:51,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {5059#true} ~n := #in~n; {5161#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:51,998 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:51,998 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:51,998 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:51,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {5059#true} ~n := #in~n; {5148#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:51,999 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:52,000 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:52,000 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:52,001 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:52,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:52,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:52,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:52,002 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:52,002 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:52,005 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:52,007 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:52,007 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:52,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:52,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:52,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:52,011 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:52,011 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:52,012 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:52,012 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:52,013 INFO L272 TraceCheckUtils]: 35: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5060#false} is VALID [2022-02-21 04:19:52,013 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:52,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:52,824 INFO L272 TraceCheckUtils]: 35: Hoare triple {5060#false} call #t~ret5 := fibo2(~n - 2); {5060#false} is VALID [2022-02-21 04:19:52,825 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:52,825 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:52,826 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:52,826 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:52,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:52,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:52,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:52,827 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:52,828 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:52,828 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:52,828 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:52,829 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:52,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {5059#true} assume true; {5059#true} is VALID [2022-02-21 04:19:52,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {5059#true} assume ~n < 1;#res := 0; {5059#true} is VALID [2022-02-21 04:19:52,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {5059#true} ~n := #in~n; {5059#true} is VALID [2022-02-21 04:19:52,829 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:52,830 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:52,830 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:52,831 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:52,831 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:52,831 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:52,832 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:52,833 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:52,843 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:52,844 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:52,844 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:52,844 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:52,845 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:52,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:52,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:52,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {5135#(<= 4 fibo1_~n)} assume !(~n < 1); {5135#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:52,846 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:52,846 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:52,847 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:52,847 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:52,847 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:52,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158578648] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:52,847 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:52,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 16 [2022-02-21 04:19:52,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015587559] [2022-02-21 04:19:52,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:52,848 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 2 times [2022-02-21 04:19:52,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:52,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411615323] [2022-02-21 04:19:52,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:52,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:52,861 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:52,988 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:52,988 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:52,988 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:52,988 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:52,988 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:52,988 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,988 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:52,988 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:52,988 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration4_Loop [2022-02-21 04:19:52,988 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:52,988 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:52,989 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,991 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,992 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,994 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,998 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:53,000 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:53,002 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:53,003 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:53,004 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:53,006 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:53,066 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:53,066 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:53,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,076 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:53,083 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:53,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:53,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:53,090 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:53,090 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:53,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:53,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,127 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:53,129 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:53,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:53,131 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:53,136 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:53,136 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:53,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 04:19:53,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,154 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:53,154 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:53,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:53,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:53,177 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:53,177 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:53,194 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:53,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,196 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:53,197 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:53,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:53,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:53,235 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:53,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,236 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:53,237 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:53,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:53,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:53,301 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:53,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:53,306 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:53,306 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:53,306 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:53,306 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:53,307 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:53,307 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,307 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:53,307 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:53,307 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration4_Loop [2022-02-21 04:19:53,307 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:53,307 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:53,307 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:53,310 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:53,311 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:53,313 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:53,318 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:53,320 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:53,322 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:53,324 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:53,325 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:53,327 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:53,400 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:53,400 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:53,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,401 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:53,402 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:53,404 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:53,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:53,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:53,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:53,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:53,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:53,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:53,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:53,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:53,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:53,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,443 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:53,444 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:53,446 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:53,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:53,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:53,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:53,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:53,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:53,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:53,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:53,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:53,482 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:53,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,484 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:53,485 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:53,486 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:53,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:53,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:53,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:53,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:53,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:53,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:53,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:53,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:53,522 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:53,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,524 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:53,525 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:53,526 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:53,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:53,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:53,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:53,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:53,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:53,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:53,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:53,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:53,538 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:19:53,538 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:19:53,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:53,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,540 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:53,541 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:53,542 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:53,542 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:53,542 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:53,542 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2022-02-21 04:19:53,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:53,563 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:53,565 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:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:19:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:53,770 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:53,990 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,990 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,991 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,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#unseeded} ~n := #in~n; {5343#unseeded} is VALID [2022-02-21 04:19:53,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {5343#unseeded} assume !(~n < 1); {5343#unseeded} is VALID [2022-02-21 04:19:53,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {5343#unseeded} assume !(1 == ~n); {5343#unseeded} is VALID [2022-02-21 04:19:53,992 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:53,993 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:53,993 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:53,994 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:53,994 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:53,995 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:53,996 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:53,996 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:53,997 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:53,997 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:53,997 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:53,998 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:53,999 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:53,999 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:54,000 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:54,000 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:54,000 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:54,001 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:54,002 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:54,002 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:54,003 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:54,003 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:54,004 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:54,004 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:54,005 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:54,005 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:54,006 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:54,006 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:54,007 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:54,007 INFO L272 TraceCheckUtils]: 35: Hoare triple {5343#unseeded} call #t~ret5 := fibo2(~n - 2); {5343#unseeded} is VALID [2022-02-21 04:19:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:54,140 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:54,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {5467#(<= fibo2_~n oldRank0)} assume !(~n < 1); {5467#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:54,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {5467#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {5467#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:54,141 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:54,142 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:54,142 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:54,142 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:54,143 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:54,143 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,144 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,178 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,178 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,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,178 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:54,179 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,452 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,453 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,453 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:54,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:54,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:54,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:54,453 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,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:54,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:54,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:54,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 941 transitions. [2022-02-21 04:19:54,457 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:54,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:54,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:54,458 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:54,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:54,463 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,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:54,465 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:54,465 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 671 states and 941 transitions. cyclomatic complexity: 286 [2022-02-21 04:19:54,469 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 36 examples of accepted words. [2022-02-21 04:19:54,469 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,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,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 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,470 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,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,470 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,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,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 2 letters. Loop has 5 letters. [2022-02-21 04:19:54,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,470 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,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,471 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,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,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 36 letters. Loop has 8 letters. [2022-02-21 04:19:54,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,471 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,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,471 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,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,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 671 letters. Loop has 671 letters. [2022-02-21 04:19:54,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,472 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,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,472 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,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,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 165 letters. Loop has 165 letters. [2022-02-21 04:19:54,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,473 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,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,473 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,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,473 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,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,473 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,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,473 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,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,474 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,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,474 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,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,481 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,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,481 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,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,481 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,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,482 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,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,482 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,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,482 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,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,482 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,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,483 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,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,483 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,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,483 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,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,483 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,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,484 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,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,484 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,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,484 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,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,484 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,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,485 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,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,485 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,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,485 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,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,485 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,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,486 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,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,486 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,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,486 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,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,486 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,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,486 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,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,487 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,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,487 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,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,487 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,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,487 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,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,488 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,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,488 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,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,488 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,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,488 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,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,489 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,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,489 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,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,489 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,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,490 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,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,490 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,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,490 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,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,490 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,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,491 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,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,491 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,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,491 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,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,491 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,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,492 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,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,492 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,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,492 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,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,492 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,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,492 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,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,493 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,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,493 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,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,493 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,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,493 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,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,494 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,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,494 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,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,494 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,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,494 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,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,495 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,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,495 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,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,495 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,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,495 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,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,496 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,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,496 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,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,496 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,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,496 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,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,497 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,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,497 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,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,497 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,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,497 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,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,498 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,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,498 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,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,498 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,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,498 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,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,499 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,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,499 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,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,499 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,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,500 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,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,500 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,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,500 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,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,500 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,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,500 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,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,501 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,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,501 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,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,501 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,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,501 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,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,502 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,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,502 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,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,502 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,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,502 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,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,503 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,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,503 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,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,503 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,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,503 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,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,504 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,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,504 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,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,504 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,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,504 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,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,505 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,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,505 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,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,505 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,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,505 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,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,505 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,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,506 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,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,506 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,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,506 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,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,506 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,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,507 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,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,507 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,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,507 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,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,507 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,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,508 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,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,508 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,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,508 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,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,508 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,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,509 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,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,509 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,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,509 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,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,509 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,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,510 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,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,510 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,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,510 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,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,510 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,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,511 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,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,511 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,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,511 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,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,512 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,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,512 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,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,512 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,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,512 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,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,513 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,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,513 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,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,513 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,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,513 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,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,514 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,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,514 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,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,514 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,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,514 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,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,514 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,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,515 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,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,515 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,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,515 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,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,515 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,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,516 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,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,516 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,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,516 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,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,516 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,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,517 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,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,517 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,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,517 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,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,517 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,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,518 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,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,518 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,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,518 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,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,518 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,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,519 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,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,519 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,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,519 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,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,519 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,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,520 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,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,520 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,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,520 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,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,521 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,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,521 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,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,521 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,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,521 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,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,521 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,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,522 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,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,522 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,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,522 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,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,522 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,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,523 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,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,523 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,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,523 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,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,523 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,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,524 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,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,524 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,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,524 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,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,524 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,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,525 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,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,525 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,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,525 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,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,525 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,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,526 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,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,526 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,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,526 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,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,526 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,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,527 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,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,527 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:54,527 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,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 04:19:54,528 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,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:54,528 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:19:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:19:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:54,896 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,897 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,897 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,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#unseeded} ~n := #in~n; {5343#unseeded} is VALID [2022-02-21 04:19:54,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {5343#unseeded} assume !(~n < 1); {5343#unseeded} is VALID [2022-02-21 04:19:54,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {5343#unseeded} assume !(1 == ~n); {5343#unseeded} is VALID [2022-02-21 04:19:54,899 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:54,899 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:54,900 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:54,900 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:54,901 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:54,901 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:54,901 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:54,902 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:54,902 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:54,903 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:54,903 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:54,904 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:54,904 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:54,905 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:54,905 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:54,906 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:54,906 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:54,907 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:54,908 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:54,908 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:54,909 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:54,909 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:54,910 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:54,911 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:54,911 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:54,912 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:54,912 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:54,913 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:54,914 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:54,917 INFO L272 TraceCheckUtils]: 35: Hoare triple {5343#unseeded} call #t~ret5 := fibo2(~n - 2); {5343#unseeded} is VALID [2022-02-21 04:19:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:55,051 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:55,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {6310#(<= fibo2_~n oldRank0)} assume !(~n < 1); {6310#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:55,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {6310#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {6310#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:55,056 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:55,057 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:55,058 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:55,058 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:55,063 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:55,064 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:55,064 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:55,094 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:55,094 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,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,094 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:55,094 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,345 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:55,345 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,345 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:55,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:55,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:55,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:55,346 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,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:55,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:55,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:55,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 941 transitions. [2022-02-21 04:19:55,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:55,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:55,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:55,350 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:55,350 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:55,351 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,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:55,351 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:55,351 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 671 states and 941 transitions. cyclomatic complexity: 286 [2022-02-21 04:19:55,357 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 36 examples of accepted words. [2022-02-21 04:19:55,357 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,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,357 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,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,358 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:55,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,358 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,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,358 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,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,358 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:55,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,358 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,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,359 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,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,359 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:55,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,359 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:55,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,359 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:55,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,360 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:55,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,360 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,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,360 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,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,360 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:55,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,360 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,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,361 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,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,361 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:55,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,361 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,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,361 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,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,361 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:55,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,362 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,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,362 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,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,362 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:55,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,362 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,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,363 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,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,363 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:55,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,363 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,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,363 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,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,363 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:55,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,364 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,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,364 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,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,364 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:55,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,364 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,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,365 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,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,365 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:55,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,365 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,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,365 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,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,366 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:55,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,366 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,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,366 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,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,366 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:55,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,367 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,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,367 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,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,367 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:55,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,367 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,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,368 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,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,368 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:55,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,368 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,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,368 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,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,368 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:55,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,369 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,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,369 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,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,369 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:55,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,369 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,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,370 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,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,370 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:55,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,370 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,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,371 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,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,371 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:55,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,371 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,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,371 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,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,371 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:55,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,372 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,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,372 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,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,372 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:55,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,372 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,373 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,373 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:55,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,373 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,373 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,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,374 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:55,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,374 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,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,374 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,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,374 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:55,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,375 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,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,375 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,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,375 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:55,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,375 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,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,376 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,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,376 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:55,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,376 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,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,376 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,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,376 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:55,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,377 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,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,377 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,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,377 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:55,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,377 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,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,378 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,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,378 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:55,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,378 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,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,378 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,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,379 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:55,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,379 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,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,379 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,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,379 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:55,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,380 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,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,380 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,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,380 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:55,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,380 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,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,380 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,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,381 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:55,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,381 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,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,381 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,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,381 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:55,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,382 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,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,382 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,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,382 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:55,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,382 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,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,383 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,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,383 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:55,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,383 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,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,383 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,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,383 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:55,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,384 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,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,384 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,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,384 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:55,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,384 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,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,385 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,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,385 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:55,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,385 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,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,385 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,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,386 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:55,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,386 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,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,386 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,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,386 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:55,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,387 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,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,387 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,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,387 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:55,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,387 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,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,387 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,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,388 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:55,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,388 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,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,388 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,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,388 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:55,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,389 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,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,389 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,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,389 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:55,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,389 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,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,390 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,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,390 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:55,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,390 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,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,390 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,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,390 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:55,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,391 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,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,391 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,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,391 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:55,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,391 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,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,392 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,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,392 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:55,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,392 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,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,392 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,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,392 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:55,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,393 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,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,393 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,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,393 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:55,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,393 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:55,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,394 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:55,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,394 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:55,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,394 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,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,394 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,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,395 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:55,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,395 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,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,395 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,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,395 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:55,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,396 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:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,396 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:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,396 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:55,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,396 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,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,397 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,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,397 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:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,397 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:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,397 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:55,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,398 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:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,398 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:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,398 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:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,398 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:55,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,398 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,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,399 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,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,399 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:55,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,399 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,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,399 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,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,400 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:55,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,400 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,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,400 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,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,400 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:55,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,401 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,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,401 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,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,401 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:55,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,401 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,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,402 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,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,402 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:55,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,402 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,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,402 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,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,403 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:55,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,403 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:55,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,403 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:55,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,403 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:55,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,404 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,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,404 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,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,404 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:55,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,404 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,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,405 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,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,405 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:55,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,405 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:55,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,405 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:55,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,406 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:55,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,406 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:55,406 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,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 04:19:55,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:55,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,407 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:19:55,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:55,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:19:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:55,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:55,811 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:55,811 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:55,811 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:55,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {5343#unseeded} ~n := #in~n; {5343#unseeded} is VALID [2022-02-21 04:19:55,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {5343#unseeded} assume !(~n < 1); {5343#unseeded} is VALID [2022-02-21 04:19:55,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {5343#unseeded} assume !(1 == ~n); {5343#unseeded} is VALID [2022-02-21 04:19:55,813 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:55,813 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:55,813 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:55,814 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:55,814 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:55,815 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:55,815 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:55,815 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:55,816 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:55,816 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:55,817 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:55,817 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:55,818 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:55,818 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:55,818 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:55,819 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:55,819 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:55,820 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:55,820 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:55,820 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:55,821 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:55,822 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:55,822 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:55,822 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:55,823 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:55,823 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:55,824 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:55,824 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:55,825 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:55,825 INFO L272 TraceCheckUtils]: 35: Hoare triple {5343#unseeded} call #t~ret5 := fibo2(~n - 2); {5343#unseeded} is VALID [2022-02-21 04:19:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:55,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:55,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:55,925 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:55,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {7153#(<= fibo2_~n oldRank0)} assume !(~n < 1); {7153#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:55,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {7153#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {7153#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:55,927 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:55,927 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:55,927 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:55,928 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:55,928 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:55,928 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:55,929 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:55,956 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:55,956 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,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:55,957 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:55,957 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:56,202 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:56,203 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:56,203 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:56,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:56,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:56,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:56,203 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:56,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:56,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:56,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:56,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 553 states and 762 transitions. [2022-02-21 04:19:56,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2022-02-21 04:19:56,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:56,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:56,223 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 225 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:56,224 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:56,224 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:56,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:56,225 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:56,225 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 553 states and 762 transitions. cyclomatic complexity: 217 [2022-02-21 04:19:56,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 40 examples of accepted words. [2022-02-21 04:19:56,232 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:56,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,233 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:56,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,233 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:56,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,233 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:56,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,234 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:56,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,234 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:56,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,234 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:56,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,234 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:56,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,234 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:56,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,234 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:56,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,234 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:56,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,235 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:56,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,236 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:56,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,236 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:56,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,236 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:56,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,236 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:56,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,236 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:56,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,236 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:56,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,236 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:56,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,236 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:56,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,236 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:56,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,237 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:56,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,237 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:56,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,237 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:56,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,237 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:56,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,237 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:56,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,237 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:56,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,237 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:56,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,237 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:56,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,238 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:56,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,238 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:56,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,238 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:56,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,238 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:56,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,238 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:56,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,238 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:56,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,238 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:56,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,239 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:56,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,239 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:56,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,239 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:56,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,239 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:56,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,239 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:56,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,239 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:56,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,239 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:56,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,240 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:56,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,240 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:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,241 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:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,241 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:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,241 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:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,241 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:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,241 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:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,241 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:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,241 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:56,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,242 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:56,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,242 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:56,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,242 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:56,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,242 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:56,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,242 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:56,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,243 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:56,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,243 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:56,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,243 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:56,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,243 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:56,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,243 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:56,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,243 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:56,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,243 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:56,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,244 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:56,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,244 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:56,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,244 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:56,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,244 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:56,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,244 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:56,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,244 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:56,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,244 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:56,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,244 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:56,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,244 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:56,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,245 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:56,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,245 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:56,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,245 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:56,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,245 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:56,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,245 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:56,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,245 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:56,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,245 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:56,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,245 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:56,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,245 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:56,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,246 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:56,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,246 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:56,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,246 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:56,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,246 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:56,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,246 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:56,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,246 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:56,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,246 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:56,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,246 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:56,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,247 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:56,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,247 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:56,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,247 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:56,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,259 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:56,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,260 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:56,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,260 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:56,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,260 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:56,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,260 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:56,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,261 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:56,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,261 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:56,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,261 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:56,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,261 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:56,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,261 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:56,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,262 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:56,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,262 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:56,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,262 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:56,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,262 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:56,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,263 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:56,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,263 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:56,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 64 letters. Loop has 8 letters. [2022-02-21 04:19:56,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,263 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:56,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,264 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:56,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 61 letters. Loop has 8 letters. [2022-02-21 04:19:56,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,264 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:56,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,264 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:56,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 62 letters. Loop has 8 letters. [2022-02-21 04:19:56,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,265 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:56,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,265 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:56,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 60 letters. Loop has 50 letters. [2022-02-21 04:19:56,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,266 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:56,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,266 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:56,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 63 letters. Loop has 8 letters. [2022-02-21 04:19:56,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,266 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:56,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,267 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:56,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 32 letters. Loop has 13 letters. [2022-02-21 04:19:56,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,267 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:56,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,267 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:56,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 65 letters. Loop has 8 letters. [2022-02-21 04:19:56,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,268 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:56,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,268 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:56,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 36 letters. Loop has 13 letters. [2022-02-21 04:19:56,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,287 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:56,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,287 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:56,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 60 letters. Loop has 90 letters. [2022-02-21 04:19:56,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,288 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:56,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,288 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:56,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 32 letters. Loop has 111 letters. [2022-02-21 04:19:56,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,288 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:56,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,289 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:56,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 32 letters. Loop has 13 letters. [2022-02-21 04:19:56,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,289 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:56,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,289 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:56,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 60 letters. Loop has 61 letters. [2022-02-21 04:19:56,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,289 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:56,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,289 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:56,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 60 letters. Loop has 14 letters. [2022-02-21 04:19:56,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,290 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:56,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,290 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:56,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 32 letters. Loop has 175 letters. [2022-02-21 04:19:56,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,290 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:56,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,291 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:56,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 32 letters. Loop has 90 letters. [2022-02-21 04:19:56,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,291 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:56,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,291 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:56,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 60 letters. Loop has 98 letters. [2022-02-21 04:19:56,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,292 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:56,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,292 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:56,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 32 letters. Loop has 117 letters. [2022-02-21 04:19:56,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,293 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:56,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,293 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:56,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 32 letters. Loop has 19 letters. [2022-02-21 04:19:56,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,293 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:56,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,293 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:56,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 43 letters. Loop has 8 letters. [2022-02-21 04:19:56,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,293 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:56,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,293 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:56,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,294 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:56,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,294 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:56,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 45 letters. Loop has 61 letters. [2022-02-21 04:19:56,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,294 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:56,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,294 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:56,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,295 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:56,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,295 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:56,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 49 letters. Loop has 14 letters. [2022-02-21 04:19:56,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,295 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:56,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,295 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:56,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 40 letters. Loop has 8 letters. [2022-02-21 04:19:56,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,295 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:56,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,296 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:56,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 52 letters. Loop has 61 letters. [2022-02-21 04:19:56,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,296 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:56,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,296 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:56,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 42 letters. Loop has 8 letters. [2022-02-21 04:19:56,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,297 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:56,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,297 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:56,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 41 letters. Loop has 8 letters. [2022-02-21 04:19:56,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,297 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:56,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,297 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:56,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,297 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:56,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,297 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:56,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,298 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:56,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,298 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:56,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 49 letters. Loop has 14 letters. [2022-02-21 04:19:56,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,298 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:56,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,298 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:56,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,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 52 letters. Loop has 178 letters. [2022-02-21 04:19:56,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,299 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:56,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,300 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:56,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,315 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:56,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,315 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:56,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,316 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:56,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,316 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:56,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,317 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:56,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,317 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:56,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,318 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:56,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,318 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:56,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,318 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:56,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,319 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:56,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,319 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:56,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,320 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:56,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,320 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:56,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,320 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:56,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,320 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:56,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,321 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:56,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,321 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:56,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,321 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:56,323 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:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-21 04:19:56,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:56,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 36 letters. Loop has 16 letters. [2022-02-21 04:19:56,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 553 states and 762 transitions. cyclomatic complexity: 217 [2022-02-21 04:19:56,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2022-02-21 04:19:56,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 553 states to 445 states and 639 transitions. [2022-02-21 04:19:56,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2022-02-21 04:19:56,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2022-02-21 04:19:56,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 445 states and 639 transitions. [2022-02-21 04:19:56,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:56,399 INFO L681 BuchiCegarLoop]: Abstraction has 445 states and 639 transitions. [2022-02-21 04:19:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states and 639 transitions. [2022-02-21 04:19:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 370. [2022-02-21 04:19:56,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:56,433 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:56,433 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:56,435 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:56,435 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:56,494 INFO L93 Difference]: Finished difference Result 840 states and 1183 transitions. [2022-02-21 04:19:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1183 transitions. [2022-02-21 04:19:56,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:56,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:56,523 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:56,524 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:56,524 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:56,577 INFO L93 Difference]: Finished difference Result 1191 states and 1654 transitions. [2022-02-21 04:19:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1654 transitions. [2022-02-21 04:19:56,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:56,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:56,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:56,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:56,582 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:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 507 transitions. [2022-02-21 04:19:56,590 INFO L704 BuchiCegarLoop]: Abstraction has 370 states and 507 transitions. [2022-02-21 04:19:56,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:56,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:19:56,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:19:56,591 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:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:57,282 INFO L93 Difference]: Finished difference Result 449 states and 635 transitions. [2022-02-21 04:19:57,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 04:19:57,283 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:57,333 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:57,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 449 states and 635 transitions. [2022-02-21 04:19:57,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:19:57,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 449 states to 410 states and 591 transitions. [2022-02-21 04:19:57,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 228 [2022-02-21 04:19:57,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2022-02-21 04:19:57,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 410 states and 591 transitions. [2022-02-21 04:19:57,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:57,362 INFO L681 BuchiCegarLoop]: Abstraction has 410 states and 591 transitions. [2022-02-21 04:19:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states and 591 transitions. [2022-02-21 04:19:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 359. [2022-02-21 04:19:57,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:57,371 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:57,372 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:57,372 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:57,372 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:57,416 INFO L93 Difference]: Finished difference Result 1003 states and 1442 transitions. [2022-02-21 04:19:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1442 transitions. [2022-02-21 04:19:57,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:57,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:57,421 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:57,421 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:57,422 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:57,474 INFO L93 Difference]: Finished difference Result 1012 states and 1457 transitions. [2022-02-21 04:19:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1457 transitions. [2022-02-21 04:19:57,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:57,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:57,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:57,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:57,479 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:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 496 transitions. [2022-02-21 04:19:57,487 INFO L704 BuchiCegarLoop]: Abstraction has 359 states and 496 transitions. [2022-02-21 04:19:57,487 INFO L587 BuchiCegarLoop]: Abstraction has 359 states and 496 transitions. [2022-02-21 04:19:57,487 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:19:57,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 359 states and 496 transitions. [2022-02-21 04:19:57,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:19:57,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:57,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:57,491 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:57,491 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:57,491 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:57,491 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:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1718474001, now seen corresponding path program 1 times [2022-02-21 04:19:57,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:57,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953997892] [2022-02-21 04:19:57,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-21 04:19:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:57,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:57,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,585 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:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:19:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:57,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,591 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:57,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,591 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:57,592 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:57,592 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:57,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:57,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:57,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,593 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:57,593 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:57,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:57,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,594 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:57,594 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:57,594 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:57,595 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:57,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:19:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,608 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:57,608 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:57,609 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:57,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:57,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {15365#true} assume !(1 == ~n); {15365#true} is VALID [2022-02-21 04:19:57,610 INFO L272 TraceCheckUtils]: 3: Hoare triple {15365#true} call #t~ret6 := fibo1(~n - 1); {15365#true} is VALID [2022-02-21 04:19:57,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,610 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:57,611 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:57,611 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:57,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:57,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:57,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,612 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:57,612 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:57,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:57,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,613 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:57,613 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:57,613 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:57,614 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:57,614 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:57,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,614 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:57,615 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:57,615 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:57,615 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:57,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {15366#false} assume true; {15366#false} is VALID [2022-02-21 04:19:57,616 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15366#false} {15369#(<= 4 fibo1_~n)} #50#return; {15366#false} is VALID [2022-02-21 04:19:57,616 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:57,616 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:57,617 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:57,617 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:57,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(~n < 1); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:57,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(1 == ~n); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:57,618 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:57,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:57,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#true} assume !(1 == ~n); {15365#true} is VALID [2022-02-21 04:19:57,618 INFO L272 TraceCheckUtils]: 10: Hoare triple {15365#true} call #t~ret6 := fibo1(~n - 1); {15365#true} is VALID [2022-02-21 04:19:57,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,619 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:57,619 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:57,619 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:57,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:57,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:57,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,621 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:57,621 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:57,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:57,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,622 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:57,622 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:57,622 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:57,623 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:57,623 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:57,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {15365#true} ~n := #in~n; {15421#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:57,624 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:57,624 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:57,624 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:57,624 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:57,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {15366#false} assume true; {15366#false} is VALID [2022-02-21 04:19:57,625 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15366#false} {15369#(<= 4 fibo1_~n)} #50#return; {15366#false} is VALID [2022-02-21 04:19:57,625 INFO L272 TraceCheckUtils]: 36: Hoare triple {15366#false} call #t~ret5 := fibo2(~n - 2); {15366#false} is VALID [2022-02-21 04:19:57,625 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:57,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:57,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953997892] [2022-02-21 04:19:57,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953997892] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:57,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048664396] [2022-02-21 04:19:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:57,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:57,627 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:57,628 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:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:57,805 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:57,806 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:57,806 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:57,806 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:57,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(~n < 1); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:57,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(1 == ~n); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:57,807 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:57,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {15365#true} ~n := #in~n; {15459#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:57,808 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:57,808 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:57,808 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:57,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:57,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {15365#true} assume !(1 == ~n); {15365#true} is VALID [2022-02-21 04:19:57,808 INFO L272 TraceCheckUtils]: 14: Hoare triple {15365#true} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:57,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:57,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:57,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,809 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {15365#true} {15365#true} #50#return; {15365#true} is VALID [2022-02-21 04:19:57,809 INFO L272 TraceCheckUtils]: 20: Hoare triple {15365#true} call #t~ret5 := fibo2(~n - 2); {15365#true} is VALID [2022-02-21 04:19:57,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:57,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:57,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,810 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15365#true} {15365#true} #52#return; {15365#true} is VALID [2022-02-21 04:19:57,810 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:57,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:57,810 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:57,810 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:57,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {15365#true} ~n := #in~n; {15526#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:57,811 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:57,811 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:57,812 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:57,812 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:57,812 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:57,813 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:57,813 INFO L272 TraceCheckUtils]: 36: Hoare triple {15366#false} call #t~ret5 := fibo2(~n - 2); {15366#false} is VALID [2022-02-21 04:19:57,813 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:57,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:58,182 INFO L272 TraceCheckUtils]: 36: Hoare triple {15366#false} call #t~ret5 := fibo2(~n - 2); {15366#false} is VALID [2022-02-21 04:19:58,183 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:58,183 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:58,184 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:58,184 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:58,185 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:58,185 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:58,185 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:58,185 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:58,186 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:58,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:58,186 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:58,186 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15365#true} {15365#true} #52#return; {15365#true} is VALID [2022-02-21 04:19:58,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:58,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {15365#true} assume ~n < 1;#res := 0; {15365#true} is VALID [2022-02-21 04:19:58,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:58,187 INFO L272 TraceCheckUtils]: 20: Hoare triple {15365#true} call #t~ret5 := fibo2(~n - 2); {15365#true} is VALID [2022-02-21 04:19:58,187 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {15365#true} {15365#true} #50#return; {15365#true} is VALID [2022-02-21 04:19:58,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {15365#true} assume true; {15365#true} is VALID [2022-02-21 04:19:58,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {15365#true} assume 1 == ~n;#res := 1; {15365#true} is VALID [2022-02-21 04:19:58,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:58,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:58,187 INFO L272 TraceCheckUtils]: 14: Hoare triple {15365#true} call #t~ret4 := fibo2(~n - 1); {15365#true} is VALID [2022-02-21 04:19:58,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {15365#true} assume !(1 == ~n); {15365#true} is VALID [2022-02-21 04:19:58,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {15365#true} assume !(~n < 1); {15365#true} is VALID [2022-02-21 04:19:58,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {15365#true} ~n := #in~n; {15365#true} is VALID [2022-02-21 04:19:58,188 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:58,188 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:58,188 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:58,189 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:58,189 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:58,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(1 == ~n); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:58,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {15369#(<= 4 fibo1_~n)} assume !(~n < 1); {15369#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:58,190 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:58,190 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:58,190 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:58,190 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:58,191 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:58,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048664396] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:58,191 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:58,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-02-21 04:19:58,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684012332] [2022-02-21 04:19:58,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:58,192 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 688787707, now seen corresponding path program 1 times [2022-02-21 04:19:58,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:58,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3385611] [2022-02-21 04:19:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 04:19:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,313 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:58,313 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:58,314 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:58,314 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:58,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:19:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,320 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:58,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,321 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:58,322 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:58,322 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:58,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,322 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:58,323 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:58,323 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:58,324 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:58,324 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:58,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,325 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:58,325 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:58,326 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:58,326 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:58,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:19:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:58,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,382 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:58,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:19:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:58,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,386 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:58,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,387 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:58,387 INFO L272 TraceCheckUtils]: 9: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,387 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:58,387 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:58,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,388 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:58,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:19:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:58,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,392 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,392 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:58,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,393 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:58,393 INFO L272 TraceCheckUtils]: 13: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,394 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:58,394 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:58,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,394 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:58,394 INFO L272 TraceCheckUtils]: 21: Hoare triple {15656#true} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,395 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:58,395 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:58,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,395 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:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 04:19:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,400 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:58,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,401 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:58,401 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:58,401 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:58,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,402 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,403 INFO L272 TraceCheckUtils]: 11: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:58,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,403 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:58,403 INFO L272 TraceCheckUtils]: 17: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,404 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:58,404 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:58,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,404 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:58,405 INFO L272 TraceCheckUtils]: 25: Hoare triple {15656#true} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,405 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:58,405 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:58,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,406 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:58,406 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:58,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,407 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:58,408 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:58,408 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:58,408 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:58,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,409 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,410 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:58,410 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:58,410 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:58,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,411 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:58,411 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:58,411 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:58,412 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:58,412 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:58,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,413 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:58,413 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:58,414 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:58,414 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:58,414 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:58,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,415 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:58,415 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:58,416 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:58,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,416 INFO L272 TraceCheckUtils]: 29: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,417 INFO L272 TraceCheckUtils]: 33: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:58,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,417 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:58,417 INFO L272 TraceCheckUtils]: 39: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,418 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:58,418 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:58,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,418 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:58,419 INFO L272 TraceCheckUtils]: 47: Hoare triple {15656#true} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,419 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:58,419 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:58,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,420 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:58,420 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:58,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,421 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:58,421 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:58,422 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:58,422 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:58,422 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:58,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {15657#false} assume true; {15657#false} is VALID [2022-02-21 04:19:58,423 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {15657#false} {15656#true} #50#return; {15657#false} is VALID [2022-02-21 04:19:58,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,423 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,424 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,424 INFO L272 TraceCheckUtils]: 11: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,425 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:58,425 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:58,425 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:58,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {15656#true} ~n := #in~n; {15795#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,426 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:58,426 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:58,427 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,427 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:58,427 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:58,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,428 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:58,429 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,429 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,429 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,430 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,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {15656#true} ~n := #in~n; {15783#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,430 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:58,431 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:58,431 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:58,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,431 INFO L272 TraceCheckUtils]: 37: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,432 INFO L272 TraceCheckUtils]: 41: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:58,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,432 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:58,433 INFO L272 TraceCheckUtils]: 47: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,433 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:58,433 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,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,433 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15656#true} {15656#true} #46#return; {15656#true} is VALID [2022-02-21 04:19:58,434 INFO L272 TraceCheckUtils]: 55: Hoare triple {15656#true} call #t~ret7 := fibo1(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,434 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15656#true} {15656#true} #48#return; {15656#true} is VALID [2022-02-21 04:19:58,434 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:58,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,435 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:58,435 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:58,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,435 INFO L290 TraceCheckUtils]: 66: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,436 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:58,436 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,436 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,437 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,437 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,437 INFO L290 TraceCheckUtils]: 72: Hoare triple {15657#false} assume true; {15657#false} is VALID [2022-02-21 04:19:58,437 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15657#false} {15656#true} #50#return; {15657#false} is VALID [2022-02-21 04:19:58,438 INFO L272 TraceCheckUtils]: 74: Hoare triple {15657#false} call #t~ret5 := fibo2(~n - 2); {15657#false} is VALID [2022-02-21 04:19:58,438 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:58,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:58,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3385611] [2022-02-21 04:19:58,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3385611] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:58,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693672738] [2022-02-21 04:19:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:58,440 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:58,441 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:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:19:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:58,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,734 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,734 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret4 := fibo2(~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,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]: 10: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L272 TraceCheckUtils]: 11: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#true} ~n := #in~n; {15902#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:58,735 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:58,735 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:58,736 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:58,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {15656#true} ~n := #in~n; {15915#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:58,736 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:58,736 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:58,737 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,737 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:58,738 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,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,738 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,739 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,739 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,739 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,740 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,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {15656#true} ~n := #in~n; {15958#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:58,740 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:58,740 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:58,740 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:58,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {15656#true} ~n := #in~n; {15971#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:58,741 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:58,741 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,742 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,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:58,742 INFO L272 TraceCheckUtils]: 41: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:58,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:58,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:58,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,743 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:58,743 INFO L272 TraceCheckUtils]: 47: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:58,743 INFO L290 TraceCheckUtils]: 48: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,743 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:58,743 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,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,744 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,744 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,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,745 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,745 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,745 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,746 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:58,746 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,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:58,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:58,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:58,747 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,747 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,747 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,748 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,748 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,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {15657#false} assume true; {15657#false} is VALID [2022-02-21 04:19:58,748 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15657#false} {15656#true} #50#return; {15657#false} is VALID [2022-02-21 04:19:58,748 INFO L272 TraceCheckUtils]: 74: Hoare triple {15657#false} call #t~ret5 := fibo2(~n - 2); {15657#false} is VALID [2022-02-21 04:19:58,749 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,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:59,845 INFO L272 TraceCheckUtils]: 74: Hoare triple {15657#false} call #t~ret5 := fibo2(~n - 2); {15657#false} is VALID [2022-02-21 04:19:59,846 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15657#false} {15656#true} #50#return; {15657#false} is VALID [2022-02-21 04:19:59,846 INFO L290 TraceCheckUtils]: 72: Hoare triple {15657#false} assume true; {15657#false} is VALID [2022-02-21 04:19:59,846 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:59,846 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:59,847 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:59,847 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:59,848 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:59,848 INFO L290 TraceCheckUtils]: 66: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:59,848 INFO L290 TraceCheckUtils]: 65: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:59,848 INFO L290 TraceCheckUtils]: 64: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:59,848 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:59,849 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:59,849 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:59,849 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:59,850 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:59,850 INFO L290 TraceCheckUtils]: 58: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:59,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:59,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:59,850 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:59,851 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:59,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:59,851 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:59,851 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {15656#true} {15656#true} #52#return; {15656#true} is VALID [2022-02-21 04:19:59,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:59,851 INFO L290 TraceCheckUtils]: 49: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:59,851 INFO L290 TraceCheckUtils]: 48: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:59,851 INFO L272 TraceCheckUtils]: 47: Hoare triple {15656#true} call #t~ret5 := fibo2(~n - 2); {15656#true} is VALID [2022-02-21 04:19:59,852 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15656#true} {15656#true} #50#return; {15656#true} is VALID [2022-02-21 04:19:59,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:59,852 INFO L290 TraceCheckUtils]: 44: Hoare triple {15656#true} assume 1 == ~n;#res := 1; {15656#true} is VALID [2022-02-21 04:19:59,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:59,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:59,852 INFO L272 TraceCheckUtils]: 41: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:59,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:59,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:59,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:59,853 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:59,853 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:59,853 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:59,854 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:59,854 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:59,854 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:59,854 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:59,855 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:59,855 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:59,855 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:59,856 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:59,856 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:59,856 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:59,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {15656#true} assume true; {15656#true} is VALID [2022-02-21 04:19:59,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {15656#true} assume ~n < 1;#res := 0; {15656#true} is VALID [2022-02-21 04:19:59,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:59,857 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:59,857 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:59,858 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:59,858 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:59,858 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:59,859 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:59,859 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:59,859 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:59,859 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:59,860 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:59,860 INFO L272 TraceCheckUtils]: 11: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:59,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:59,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:59,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:59,860 INFO L272 TraceCheckUtils]: 7: Hoare triple {15656#true} call #t~ret4 := fibo2(~n - 1); {15656#true} is VALID [2022-02-21 04:19:59,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:59,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:59,861 INFO L290 TraceCheckUtils]: 4: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:59,861 INFO L272 TraceCheckUtils]: 3: Hoare triple {15656#true} call #t~ret6 := fibo1(~n - 1); {15656#true} is VALID [2022-02-21 04:19:59,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {15656#true} assume !(1 == ~n); {15656#true} is VALID [2022-02-21 04:19:59,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {15656#true} assume !(~n < 1); {15656#true} is VALID [2022-02-21 04:19:59,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {15656#true} ~n := #in~n; {15656#true} is VALID [2022-02-21 04:19:59,861 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:59,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693672738] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:59,862 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:59,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-02-21 04:19:59,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821565840] [2022-02-21 04:19:59,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:59,863 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:19:59,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:59,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:19:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:19:59,863 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:20:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:00,274 INFO L93 Difference]: Finished difference Result 387 states and 546 transitions. [2022-02-21 04:20:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 04:20:00,275 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:20:00,314 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:20:00,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 546 transitions. [2022-02-21 04:20:00,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:20:00,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 387 states and 546 transitions. [2022-02-21 04:20:00,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2022-02-21 04:20:00,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2022-02-21 04:20:00,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 546 transitions. [2022-02-21 04:20:00,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:00,334 INFO L681 BuchiCegarLoop]: Abstraction has 387 states and 546 transitions. [2022-02-21 04:20:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 546 transitions. [2022-02-21 04:20:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 369. [2022-02-21 04:20:00,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:00,341 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:20:00,342 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:20:00,342 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:20:00,343 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:00,379 INFO L93 Difference]: Finished difference Result 965 states and 1340 transitions. [2022-02-21 04:20:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1340 transitions. [2022-02-21 04:20:00,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:00,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:00,384 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:20:00,384 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:20:00,385 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:00,423 INFO L93 Difference]: Finished difference Result 965 states and 1340 transitions. [2022-02-21 04:20:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1340 transitions. [2022-02-21 04:20:00,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:00,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:00,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:00,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:00,427 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:20:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 508 transitions. [2022-02-21 04:20:00,435 INFO L704 BuchiCegarLoop]: Abstraction has 369 states and 508 transitions. [2022-02-21 04:20:00,435 INFO L587 BuchiCegarLoop]: Abstraction has 369 states and 508 transitions. [2022-02-21 04:20:00,435 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:20:00,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 508 transitions. [2022-02-21 04:20:00,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:20:00,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:00,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:00,437 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:20:00,437 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:20:00,437 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:20:00,438 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:20:00,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:00,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1036448488, now seen corresponding path program 1 times [2022-02-21 04:20:00,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:00,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510770148] [2022-02-21 04:20:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:20:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:20:00,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {20197#true} assume !(~n < 1); {20197#true} is VALID [2022-02-21 04:20:00,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {20197#true} assume 1 == ~n;#res := 1; {20197#true} is VALID [2022-02-21 04:20:00,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:20:00,539 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:20:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:20:00,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:20:00,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:20:00,542 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:20:00,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {20197#true} ~n := #in~n; {20223#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,543 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:20:00,543 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:20:00,543 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:20:00,543 INFO L290 TraceCheckUtils]: 4: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:20:00,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {20197#true} assume !(~n < 1); {20197#true} is VALID [2022-02-21 04:20:00,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {20197#true} assume 1 == ~n;#res := 1; {20197#true} is VALID [2022-02-21 04:20:00,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:20:00,544 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:20:00,544 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:20:00,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:20:00,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:20:00,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:20:00,544 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:20:00,544 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:20:00,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {20235#(<= 2 |fibo2_#in~n|)} assume true; {20235#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,545 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:20:00,545 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,546 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,546 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,546 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,546 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,547 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,547 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,547 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,547 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,548 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,548 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,548 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,548 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,549 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,549 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,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {20197#true} ~n := #in~n; {20223#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,549 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:20:00,550 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:20:00,550 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:20:00,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:20:00,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {20197#true} assume !(~n < 1); {20197#true} is VALID [2022-02-21 04:20:00,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {20197#true} assume 1 == ~n;#res := 1; {20197#true} is VALID [2022-02-21 04:20:00,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:20:00,550 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:20:00,550 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:20:00,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:20:00,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:20:00,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:20:00,551 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:20:00,551 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,551 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,552 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,552 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:20:00,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:00,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510770148] [2022-02-21 04:20:00,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510770148] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:00,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619074882] [2022-02-21 04:20:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:00,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:00,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:00,559 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:20:00,560 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:20:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 04:20:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:00,757 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,757 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,758 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,758 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,758 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,759 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,759 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,759 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,760 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,760 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,760 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,761 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,761 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,761 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,761 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,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {20197#true} ~n := #in~n; {20284#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,762 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:20:00,762 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:20:00,763 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:20:00,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {20197#true} ~n := #in~n; {20297#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,763 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:20:00,764 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,764 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,765 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:20:00,765 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,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:20:00,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:20:00,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:20:00,766 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,766 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,766 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,767 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,767 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,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:01,225 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:01,226 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:01,226 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:01,227 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:01,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {20197#true} assume true; {20197#true} is VALID [2022-02-21 04:20:01,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {20197#true} assume ~n < 1;#res := 0; {20197#true} is VALID [2022-02-21 04:20:01,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {20197#true} ~n := #in~n; {20197#true} is VALID [2022-02-21 04:20:01,227 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:01,228 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:01,228 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:01,229 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:01,229 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:01,229 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:01,229 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:01,230 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:01,230 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:01,231 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:01,231 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:01,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {20205#(<= fibo1_~n 2)} assume !(1 == ~n); {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:01,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {20205#(<= fibo1_~n 2)} assume !(~n < 1); {20205#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:01,232 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:01,232 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:01,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {20203#(<= fibo2_~n 3)} assume !(1 == ~n); {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:01,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {20203#(<= fibo2_~n 3)} assume !(~n < 1); {20203#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:01,233 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:01,234 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:01,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {20201#(<= fibo1_~n 4)} assume !(1 == ~n); {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:01,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {20201#(<= fibo1_~n 4)} assume !(~n < 1); {20201#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:01,235 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:01,235 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:01,236 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:01,236 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:01,236 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:01,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619074882] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:01,236 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:01,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2022-02-21 04:20:01,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073134096] [2022-02-21 04:20:01,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:01,237 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1626884941, now seen corresponding path program 1 times [2022-02-21 04:20:01,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:01,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767493718] [2022-02-21 04:20:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:01,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:01,254 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:01,671 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:01,671 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:01,671 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:01,671 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:01,671 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:01,671 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:01,671 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:01,671 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:01,672 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration6_Loop [2022-02-21 04:20:01,672 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:01,672 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:01,672 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,675 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,678 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,680 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,687 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,689 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,695 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,697 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,699 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,811 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:01,812 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:01,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:01,815 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:01,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:01,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:01,830 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:01,839 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:01,839 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:01,857 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:01,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:01,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:01,859 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:01,860 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:01,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:01,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:01,882 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:01,882 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:01,901 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:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:01,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:01,903 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:01,904 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:01,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:01,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:01,931 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:01,931 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:01,949 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:01,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:01,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:01,951 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:01,952 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:01,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:01,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:02,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:02,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:02,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:02,007 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:02,010 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:02,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:02,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:03,072 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:03,077 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:03,077 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:03,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:03,077 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:03,077 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:03,077 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:03,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:03,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:03,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:03,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration6_Loop [2022-02-21 04:20:03,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:03,078 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:03,078 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:03,080 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:03,081 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:03,082 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:03,084 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:03,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:20:03,086 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:03,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:20:03,092 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:03,145 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:03,146 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:03,147 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:03,148 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:03,149 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:03,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:03,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:03,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:03,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:03,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:03,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:03,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:03,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:03,181 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:03,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:03,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:03,183 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:03,197 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:03,203 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:03,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:03,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:03,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:03,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:03,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:03,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:03,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:03,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:03,246 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:03,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:03,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:03,247 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:03,248 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:03,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:20:03,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:03,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:03,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:03,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:03,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:03,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:03,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:03,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:03,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-02-21 04:20:03,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:03,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:03,277 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:03,278 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:03,279 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:03,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:03,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:03,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:03,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:03,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:03,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:03,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:03,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:03,316 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:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:03,317 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:03,318 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:03,320 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:03,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:03,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:03,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:03,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:03,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:03,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:03,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:03,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:03,342 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:03,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:03,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:03,344 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:03,345 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:03,346 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:03,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:03,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:03,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:03,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:03,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:03,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:03,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:03,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:03,383 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:03,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:03,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:03,385 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:03,386 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:03,387 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:03,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:03,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:03,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:03,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:03,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:03,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:03,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:03,402 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:03,406 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:20:03,407 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:20:03,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:03,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:03,409 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:03,410 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:03,411 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:03,411 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:03,411 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:03,411 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:03,427 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:03,431 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:03,433 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:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:03,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:03,527 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:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:03,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:03,729 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:03,730 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:03,731 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:03,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {20429#unseeded} ~n := #in~n; {20429#unseeded} is VALID [2022-02-21 04:20:03,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {20429#unseeded} assume !(~n < 1); {20429#unseeded} is VALID [2022-02-21 04:20:03,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {20429#unseeded} assume !(1 == ~n); {20429#unseeded} is VALID [2022-02-21 04:20:03,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {20429#unseeded} call #t~ret4 := fibo2(~n - 1); {20429#unseeded} is VALID [2022-02-21 04:20:03,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {20429#unseeded} ~n := #in~n; {20429#unseeded} is VALID [2022-02-21 04:20:03,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {20429#unseeded} assume !(~n < 1); {20429#unseeded} is VALID [2022-02-21 04:20:03,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {20429#unseeded} assume !(1 == ~n); {20429#unseeded} is VALID [2022-02-21 04:20:03,733 INFO L272 TraceCheckUtils]: 10: Hoare triple {20429#unseeded} call #t~ret6 := fibo1(~n - 1); {20429#unseeded} is VALID [2022-02-21 04:20:03,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {20429#unseeded} ~n := #in~n; {20429#unseeded} is VALID [2022-02-21 04:20:03,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {20429#unseeded} assume !(~n < 1); {20429#unseeded} is VALID [2022-02-21 04:20:03,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {20429#unseeded} assume !(1 == ~n); {20429#unseeded} is VALID [2022-02-21 04:20:03,735 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:03,735 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:03,735 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:03,736 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:03,736 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:03,737 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:03,737 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:03,738 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:03,738 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:03,739 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:03,739 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:03,740 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:03,740 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:03,741 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:03,741 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:03,742 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:03,742 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:03,743 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:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:03,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 04:20:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:03,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:04,145 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:04,147 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:04,163 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:04,164 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:04,164 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:04,165 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:04,165 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:04,165 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:04,166 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:04,166 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:04,167 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:04,167 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:04,167 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:04,168 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:04,168 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:04,169 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:04,169 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:04,170 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:04,170 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:04,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {20569#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {20569#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:04,171 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:04,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {20569#(<= |old(oldRank0)| oldRank0)} assume true; {20569#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:04,172 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:04,172 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:04,173 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:04,173 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:04,174 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:04,174 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:04,212 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:04,212 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:04,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:04,213 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:04,213 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:05,124 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:05,125 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:05,125 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:05,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 508 transitions. cyclomatic complexity: 146 [2022-02-21 04:20:05,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:05,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:05,126 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:05,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:05,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:05,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:05,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1744 states and 2390 transitions. [2022-02-21 04:20:05,136 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 143 [2022-02-21 04:20:05,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:05,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:05,137 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 369 states and 508 transitions. cyclomatic complexity: 146 [2022-02-21 04:20:05,150 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 58 examples of accepted words. [2022-02-21 04:20:05,151 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:05,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:05,152 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:05,153 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 [2022-02-21 04:20:05,182 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 147 examples of accepted words. [2022-02-21 04:20:05,182 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:05,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,183 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:05,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,183 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:05,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,184 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:05,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,184 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:05,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,184 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:05,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,184 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:05,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,184 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:05,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,185 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:05,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,185 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:05,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,185 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:05,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,185 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:05,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,186 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:05,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,186 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:05,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,186 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:05,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,186 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:05,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,187 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:05,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,187 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:05,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,187 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:05,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,187 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:05,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,187 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:05,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,188 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:05,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,188 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:05,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,188 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:05,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,188 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:05,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,189 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:05,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,189 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:05,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,189 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:05,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,189 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:05,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,190 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:05,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,190 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:05,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,190 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:05,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,190 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:05,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,190 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:05,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,191 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:05,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,191 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:05,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,191 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:05,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,191 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:05,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,192 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:05,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,192 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:05,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,192 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:05,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,192 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:05,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,193 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:05,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,193 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:05,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,193 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:05,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,193 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:05,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,194 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:05,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,194 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:05,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,194 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:05,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,194 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:05,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,194 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:05,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,195 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:05,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,195 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:05,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,195 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:05,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,195 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:05,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,196 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:05,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,196 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:05,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,196 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:05,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,196 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:05,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,196 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:05,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,197 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:05,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,197 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:05,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,197 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:05,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,197 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:05,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,198 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:05,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,198 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:05,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,198 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:05,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,198 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:05,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,198 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:05,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,199 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:05,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,199 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:05,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,199 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:05,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,199 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:05,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,200 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:05,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,200 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:05,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,200 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:05,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,201 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:05,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,201 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:05,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,202 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:05,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,202 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:05,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,202 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:05,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,202 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:05,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,203 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:05,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,203 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:05,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,203 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:05,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,203 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:05,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,204 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:05,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,204 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:05,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,204 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:05,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,204 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:05,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,205 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:05,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,205 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:05,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,205 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:05,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,206 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:05,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,206 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:05,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,206 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:05,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,206 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:05,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,207 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:05,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,207 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:05,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,207 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:05,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,208 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:05,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,209 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:05,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,209 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:05,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,209 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:05,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,210 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:05,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,210 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:05,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,210 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:05,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,210 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:05,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,211 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:05,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,211 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:05,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,211 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:05,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,211 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:05,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,212 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:05,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,212 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:05,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,212 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:05,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,212 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:05,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,213 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:05,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,213 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:05,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,213 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:05,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,213 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:05,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,213 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:05,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,214 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:05,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,214 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:05,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,214 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:05,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,214 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:05,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,215 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:05,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,215 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:05,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,215 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:05,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,215 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:05,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,216 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:05,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,218 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:05,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,218 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:05,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,218 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:05,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,219 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:05,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,219 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:05,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,219 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:05,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,219 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:05,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,220 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:05,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,220 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:05,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,220 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:05,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,220 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:05,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,220 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:05,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,221 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:05,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,221 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:05,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,221 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:05,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,221 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:05,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,222 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:05,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,222 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:05,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,222 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:05,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,222 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:05,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,223 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:05,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,223 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:05,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,223 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:05,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,223 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:05,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,224 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:05,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,224 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:05,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,224 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:05,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,224 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:05,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,225 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:05,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,225 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:05,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,225 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:05,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,225 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:05,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,225 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:05,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,226 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:05,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,226 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:05,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,226 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:05,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,227 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:05,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,227 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:05,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,227 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:05,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,228 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:05,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,228 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:05,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,228 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:05,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,229 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:05,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,229 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:05,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,229 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:05,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,229 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:05,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,230 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:05,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,230 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:05,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,230 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:05,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,230 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:05,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,231 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:05,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,231 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:05,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,231 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:05,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,232 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:05,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,232 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:05,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,232 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:05,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,232 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:05,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,233 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:05,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,233 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:05,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,233 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:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,234 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:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,234 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:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,234 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:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,235 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:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,235 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:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,235 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:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,235 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:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,236 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:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,236 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:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,236 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:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,236 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:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,237 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:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,237 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:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,237 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:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,237 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:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,238 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:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,238 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:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,238 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:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,238 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:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,238 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:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,239 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:05,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,239 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:05,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,239 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:05,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,239 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:05,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,240 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:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,240 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:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,240 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:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,240 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:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,240 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:05,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,241 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:05,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,241 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:05,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,241 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:05,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,241 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:05,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,242 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:05,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,242 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:05,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,242 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:05,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,242 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:05,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,242 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:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,243 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:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,243 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:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,243 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:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,243 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:05,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,244 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:05,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,244 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:05,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,244 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:05,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,244 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:05,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,245 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:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,245 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:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,245 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:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,245 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:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,245 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:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,246 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:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,246 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:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,246 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:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,246 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:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,247 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:05,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,247 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:05,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,247 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:05,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,247 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:05,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,247 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:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,248 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:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,248 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:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,248 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:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,248 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:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,249 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:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,249 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:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,249 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:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,249 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:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,250 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:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,250 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:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,250 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:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,250 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:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,251 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:05,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,251 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:05,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,251 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:05,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,251 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:05,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,251 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:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,252 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:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,252 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:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,252 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:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,252 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:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,253 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:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,253 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:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,253 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:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,253 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:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,254 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:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,254 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:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,254 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:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,254 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:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,255 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:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,255 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:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,255 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:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,255 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:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,256 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:05,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,256 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:05,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,256 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:05,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,256 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:05,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,257 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:05,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,257 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:05,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,257 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:05,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,257 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:05,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,258 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:05,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,258 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:05,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,258 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:05,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,258 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:05,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,259 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:05,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,259 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:05,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,259 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:05,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,260 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:05,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,260 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:05,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,260 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:05,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,260 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:05,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,261 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:05,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,261 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:05,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,261 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:05,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,261 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:05,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,262 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:05,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,262 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:05,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,262 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:05,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,262 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:05,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,263 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:05,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,263 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:05,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,263 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:05,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,263 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:05,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,264 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:05,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,264 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:05,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,264 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:05,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,264 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:05,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,264 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:05,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,265 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:05,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,265 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:05,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,265 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:05,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,265 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:05,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,266 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:05,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,266 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:05,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,266 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:05,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,266 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:05,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,267 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:05,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,267 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:05,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,267 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:05,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,267 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:05,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,267 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:05,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,268 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:05,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,268 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:05,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,268 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:05,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,268 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:05,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,269 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:05,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,269 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:05,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,269 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:05,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,269 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:05,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,270 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:05,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,270 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:05,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,270 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:05,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,270 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:05,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,271 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:05,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,271 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:05,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,271 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:05,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,271 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:05,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,272 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:05,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,272 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:05,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,272 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:05,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,272 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:05,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,273 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:05,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,273 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:05,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,273 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:05,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,274 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:05,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,274 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:05,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,274 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:05,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,282 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:05,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,282 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:05,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,283 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:05,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,283 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:05,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,283 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:05,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,284 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:05,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,284 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:05,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,285 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:05,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,285 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:05,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,285 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:05,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,286 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:05,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,286 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:05,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,286 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:05,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,286 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:05,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,287 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:05,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,287 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:05,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,287 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:05,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,288 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:05,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,288 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:05,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,288 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:05,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,288 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:05,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,289 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:05,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,289 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:05,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,290 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:05,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,290 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:05,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,290 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:05,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,290 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:05,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,291 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:05,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,291 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:05,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,291 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:05,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,292 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:05,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,292 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:05,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,292 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:05,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,292 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:05,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,293 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:05,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,293 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:05,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,293 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:05,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,293 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:05,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,294 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:05,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,294 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:05,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,294 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:05,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,294 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:05,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,295 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:05,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,295 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:05,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,295 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:05,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,296 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:05,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,296 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:05,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,296 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:05,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,297 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:05,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,297 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:05,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,297 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:05,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,297 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:05,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,298 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:05,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,298 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:05,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,298 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:05,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,298 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:05,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,299 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:05,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,299 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:05,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,299 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:05,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,300 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:05,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,300 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:05,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,300 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:05,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,301 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:05,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,301 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:05,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,301 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:05,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,302 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:05,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,302 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:05,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,302 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:05,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,303 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:05,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,303 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:05,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,303 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:05,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,304 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:05,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,304 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:05,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,304 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:05,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,305 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:05,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,305 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:05,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,305 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:05,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,306 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:05,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,306 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:05,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,306 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:05,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,307 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:05,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,307 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:05,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,307 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:05,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,308 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:05,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,308 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:05,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,308 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:05,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,309 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:05,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,309 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:05,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,309 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:05,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,310 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:05,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,310 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:05,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,310 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:05,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,311 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:05,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,311 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:05,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,311 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:05,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,312 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:05,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,312 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:05,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,313 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:05,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,313 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:05,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,313 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:05,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,314 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:05,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,314 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:05,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,314 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:05,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,315 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:05,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,315 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:05,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,315 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:05,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,316 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:05,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,316 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:05,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,316 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:05,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,317 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:05,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,317 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:05,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,317 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:05,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,318 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:05,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,318 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:05,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,318 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:05,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,319 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:05,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,319 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:05,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,319 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:05,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,320 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:05,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,320 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:05,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,320 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:05,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,320 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:05,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,321 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:05,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,321 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:05,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,321 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:05,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,321 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:05,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,321 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:05,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,322 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:05,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,322 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:05,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,322 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:05,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,322 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:05,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,323 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:05,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,323 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:05,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,323 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:05,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,323 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:05,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,324 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:05,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,324 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:05,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,324 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:05,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,324 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:05,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,324 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:05,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,325 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:05,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,325 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:05,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,325 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:05,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,325 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:05,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,326 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:05,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,326 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:05,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,326 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:05,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,326 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:05,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,326 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:05,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,327 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:05,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,327 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:05,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,327 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:05,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,327 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:05,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,328 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:05,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,328 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:05,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,328 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:05,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,328 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:05,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,329 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:05,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,329 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:05,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,329 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:05,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,329 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:05,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,330 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:05,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,330 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:05,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,330 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:05,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,331 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:05,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,331 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:05,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,331 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:05,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,331 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:05,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,332 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:05,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,332 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:05,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,332 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:05,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,333 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:05,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,333 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:05,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,333 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:05,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,333 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:05,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,334 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:05,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,334 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:05,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,334 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:05,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,334 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:05,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,335 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:05,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,335 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:05,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,335 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:05,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,336 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:05,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,336 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:05,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,336 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:05,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,336 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:05,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,337 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:05,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,337 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:05,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,337 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:05,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,338 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:05,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,338 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:05,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,338 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:05,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,338 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:05,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,339 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:05,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,339 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:05,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,339 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:05,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,339 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:05,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,340 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:05,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,340 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:05,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,340 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:05,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,341 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:05,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,341 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:05,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,341 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:05,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,341 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:05,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,342 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:05,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,342 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:05,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,342 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:05,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,342 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:05,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,343 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:05,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,343 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:05,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,343 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:05,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,343 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:05,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,344 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:05,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,344 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:05,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,344 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:05,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,344 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:05,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,345 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:05,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,345 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:05,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,345 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:05,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,345 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:05,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,346 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:05,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,346 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:05,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,346 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:05,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,346 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:05,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,347 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:05,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,347 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:05,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,347 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:05,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,348 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:05,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,348 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:05,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,348 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:05,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,348 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:05,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,349 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:05,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,349 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:05,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,349 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:05,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,350 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:05,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,350 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:05,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,350 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:05,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,351 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:05,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,351 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:05,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,351 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:05,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,351 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:05,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,352 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:05,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,352 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:05,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,352 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:05,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,352 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:05,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,353 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:05,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,353 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:05,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,353 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:05,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,353 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:05,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,354 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:05,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,354 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:05,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,354 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:05,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,355 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:05,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,355 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:05,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,355 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:05,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,356 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:05,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,356 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:05,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,357 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:05,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,357 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:05,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,357 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:05,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,357 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:05,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,358 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:05,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,358 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:05,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,358 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:05,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,359 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:05,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,359 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:05,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,359 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:05,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,359 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:05,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,360 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:05,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,360 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:05,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,360 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:05,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,361 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:05,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,361 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:05,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,361 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:05,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,362 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:05,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,362 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:05,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,362 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:05,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,362 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:05,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,363 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:05,363 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:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-02-21 04:20:05,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 68 transitions. Stem has 32 letters. Loop has 26 letters. [2022-02-21 04:20:05,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 68 transitions. Stem has 58 letters. Loop has 26 letters. [2022-02-21 04:20:05,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 68 transitions. Stem has 32 letters. Loop has 52 letters. [2022-02-21 04:20:05,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:05,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1744 states and 2390 transitions. cyclomatic complexity: 672 [2022-02-21 04:20:05,480 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 143 [2022-02-21 04:20:05,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1744 states to 1582 states and 2212 transitions. [2022-02-21 04:20:05,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 538 [2022-02-21 04:20:05,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 572 [2022-02-21 04:20:05,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1582 states and 2212 transitions. [2022-02-21 04:20:05,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:05,566 INFO L681 BuchiCegarLoop]: Abstraction has 1582 states and 2212 transitions. [2022-02-21 04:20:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states and 2212 transitions. [2022-02-21 04:20:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1505. [2022-02-21 04:20:05,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:05,596 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:05,598 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:05,600 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:05,600 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:06,117 INFO L93 Difference]: Finished difference Result 4266 states and 5980 transitions. [2022-02-21 04:20:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4266 states and 5980 transitions. [2022-02-21 04:20:06,134 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,137 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:06,138 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:06,139 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:06,660 INFO L93 Difference]: Finished difference Result 4364 states and 6108 transitions. [2022-02-21 04:20:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 6108 transitions. [2022-02-21 04:20:06,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:06,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:06,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:06,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:06,677 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:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2106 transitions. [2022-02-21 04:20:06,738 INFO L704 BuchiCegarLoop]: Abstraction has 1505 states and 2106 transitions. [2022-02-21 04:20:06,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:06,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-21 04:20:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-02-21 04:20:06,739 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:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:07,272 INFO L93 Difference]: Finished difference Result 1604 states and 1988 transitions. [2022-02-21 04:20:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 04:20:07,272 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:07,306 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:07,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1604 states and 1988 transitions. [2022-02-21 04:20:07,383 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 147 [2022-02-21 04:20:07,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1604 states to 594 states and 683 transitions. [2022-02-21 04:20:07,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2022-02-21 04:20:07,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2022-02-21 04:20:07,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 594 states and 683 transitions. [2022-02-21 04:20:07,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:07,398 INFO L681 BuchiCegarLoop]: Abstraction has 594 states and 683 transitions. [2022-02-21 04:20:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 683 transitions. [2022-02-21 04:20:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 482. [2022-02-21 04:20:07,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:07,404 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:07,405 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:07,405 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:07,406 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:07,433 INFO L93 Difference]: Finished difference Result 922 states and 1062 transitions. [2022-02-21 04:20:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1062 transitions. [2022-02-21 04:20:07,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:07,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:07,437 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:07,437 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:07,438 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:07,474 INFO L93 Difference]: Finished difference Result 1065 states and 1245 transitions. [2022-02-21 04:20:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1245 transitions. [2022-02-21 04:20:07,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:07,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:07,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:07,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:07,478 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:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 549 transitions. [2022-02-21 04:20:07,486 INFO L704 BuchiCegarLoop]: Abstraction has 482 states and 549 transitions. [2022-02-21 04:20:07,486 INFO L587 BuchiCegarLoop]: Abstraction has 482 states and 549 transitions. [2022-02-21 04:20:07,486 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:20:07,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 549 transitions. [2022-02-21 04:20:07,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 102 [2022-02-21 04:20:07,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:07,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:07,488 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:07,488 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:07,488 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:07,489 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:07,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash -979062994, now seen corresponding path program 1 times [2022-02-21 04:20:07,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:07,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877513810] [2022-02-21 04:20:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:07,503 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:07,514 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1176615322, now seen corresponding path program 1 times [2022-02-21 04:20:07,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:07,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923976434] [2022-02-21 04:20:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 04:20:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {41449#true} ~n := #in~n; {41464#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:07,546 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:07,547 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:07,547 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:07,548 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:07,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:20:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:07,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:07,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {41449#true} assume 1 == ~n;#res := 1; {41449#true} is VALID [2022-02-21 04:20:07,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {41449#true} assume true; {41449#true} is VALID [2022-02-21 04:20:07,551 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41449#true} {41450#false} #50#return; {41450#false} is VALID [2022-02-21 04:20:07,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {41449#true} call #t~ret5 := fibo2(~n - 2); {41449#true} is VALID [2022-02-21 04:20:07,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:07,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:07,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {41449#true} assume !(1 == ~n); {41449#true} is VALID [2022-02-21 04:20:07,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {41449#true} call #t~ret6 := fibo1(~n - 1); {41449#true} is VALID [2022-02-21 04:20:07,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {41449#true} ~n := #in~n; {41464#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:07,552 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:07,552 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:07,553 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:07,553 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:07,554 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:07,554 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:07,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {41458#(<= fibo1_~n 0)} assume !(~n < 1); {41450#false} is VALID [2022-02-21 04:20:07,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {41450#false} assume !(1 == ~n); {41450#false} is VALID [2022-02-21 04:20:07,555 INFO L272 TraceCheckUtils]: 14: Hoare triple {41450#false} call #t~ret4 := fibo2(~n - 1); {41449#true} is VALID [2022-02-21 04:20:07,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:07,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:07,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {41449#true} assume 1 == ~n;#res := 1; {41449#true} is VALID [2022-02-21 04:20:07,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {41449#true} assume true; {41449#true} is VALID [2022-02-21 04:20:07,555 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {41449#true} {41450#false} #50#return; {41450#false} is VALID [2022-02-21 04:20:07,555 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:07,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:07,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923976434] [2022-02-21 04:20:07,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923976434] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:07,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543196361] [2022-02-21 04:20:07,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:07,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:07,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,557 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:07,558 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:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:20:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:07,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {41449#true} call #t~ret5 := fibo2(~n - 2); {41449#true} is VALID [2022-02-21 04:20:07,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:07,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:07,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {41449#true} assume !(1 == ~n); {41449#true} is VALID [2022-02-21 04:20:07,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {41449#true} call #t~ret6 := fibo1(~n - 1); {41449#true} is VALID [2022-02-21 04:20:07,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {41449#true} ~n := #in~n; {41484#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:07,668 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:07,668 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:07,668 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:07,669 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:07,670 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:07,670 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:07,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {41458#(<= fibo1_~n 0)} assume !(~n < 1); {41450#false} is VALID [2022-02-21 04:20:07,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {41450#false} assume !(1 == ~n); {41450#false} is VALID [2022-02-21 04:20:07,671 INFO L272 TraceCheckUtils]: 14: Hoare triple {41450#false} call #t~ret4 := fibo2(~n - 1); {41450#false} is VALID [2022-02-21 04:20:07,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {41450#false} ~n := #in~n; {41450#false} is VALID [2022-02-21 04:20:07,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {41450#false} assume !(~n < 1); {41450#false} is VALID [2022-02-21 04:20:07,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {41450#false} assume 1 == ~n;#res := 1; {41450#false} is VALID [2022-02-21 04:20:07,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {41450#false} assume true; {41450#false} is VALID [2022-02-21 04:20:07,671 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {41450#false} {41450#false} #50#return; {41450#false} is VALID [2022-02-21 04:20:07,671 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:07,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:07,847 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {41449#true} {41450#false} #50#return; {41450#false} is VALID [2022-02-21 04:20:07,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {41449#true} assume true; {41449#true} is VALID [2022-02-21 04:20:07,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {41449#true} assume 1 == ~n;#res := 1; {41449#true} is VALID [2022-02-21 04:20:07,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:07,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:07,847 INFO L272 TraceCheckUtils]: 14: Hoare triple {41450#false} call #t~ret4 := fibo2(~n - 1); {41449#true} is VALID [2022-02-21 04:20:07,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {41450#false} assume !(1 == ~n); {41450#false} is VALID [2022-02-21 04:20:07,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {41458#(<= fibo1_~n 0)} assume !(~n < 1); {41450#false} is VALID [2022-02-21 04:20:07,848 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:07,849 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:07,849 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:07,850 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:07,850 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:07,851 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:07,851 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:07,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {41449#true} call #t~ret6 := fibo1(~n - 1); {41449#true} is VALID [2022-02-21 04:20:07,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {41449#true} assume !(1 == ~n); {41449#true} is VALID [2022-02-21 04:20:07,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {41449#true} assume !(~n < 1); {41449#true} is VALID [2022-02-21 04:20:07,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {41449#true} ~n := #in~n; {41449#true} is VALID [2022-02-21 04:20:07,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {41449#true} call #t~ret5 := fibo2(~n - 2); {41449#true} is VALID [2022-02-21 04:20:07,852 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:07,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543196361] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:07,852 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:07,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-02-21 04:20:07,852 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780704144] [2022-02-21 04:20:07,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:07,853 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:20:07,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 04:20:07,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 04:20:07,853 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:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:07,999 INFO L93 Difference]: Finished difference Result 326 states and 353 transitions. [2022-02-21 04:20:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:20:07,999 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:08,019 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:08,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 353 transitions. [2022-02-21 04:20:08,024 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 04:20:08,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 271 states and 298 transitions. [2022-02-21 04:20:08,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2022-02-21 04:20:08,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2022-02-21 04:20:08,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 298 transitions. [2022-02-21 04:20:08,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:08,028 INFO L681 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2022-02-21 04:20:08,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 298 transitions. [2022-02-21 04:20:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-02-21 04:20:08,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:08,031 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:08,032 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:08,032 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:08,032 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:08,039 INFO L93 Difference]: Finished difference Result 418 states and 464 transitions. [2022-02-21 04:20:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 464 transitions. [2022-02-21 04:20:08,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:08,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:08,040 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:08,041 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:08,041 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:08,048 INFO L93 Difference]: Finished difference Result 418 states and 464 transitions. [2022-02-21 04:20:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 464 transitions. [2022-02-21 04:20:08,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:08,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:08,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:08,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:08,050 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:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 298 transitions. [2022-02-21 04:20:08,052 INFO L704 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2022-02-21 04:20:08,053 INFO L587 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2022-02-21 04:20:08,053 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:20:08,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 298 transitions. [2022-02-21 04:20:08,054 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 04:20:08,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:08,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:08,054 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:08,054 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:08,054 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:08,054 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:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash 772882902, now seen corresponding path program 1 times [2022-02-21 04:20:08,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:08,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835845875] [2022-02-21 04:20:08,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:20:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:08,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:08,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:08,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,129 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:08,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:08,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:08,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {43708#true} assume !(1 == ~n); {43708#true} is VALID [2022-02-21 04:20:08,132 INFO L272 TraceCheckUtils]: 3: Hoare triple {43708#true} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:08,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:08,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,133 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:08,133 INFO L272 TraceCheckUtils]: 9: Hoare triple {43708#true} call #t~ret5 := fibo2(~n - 2); {43708#true} is VALID [2022-02-21 04:20:08,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:08,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,133 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:08,133 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:08,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,134 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:08,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-21 04:20:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:08,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:08,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,146 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {43708#true} {43709#false} #50#return; {43709#false} is VALID [2022-02-21 04:20:08,147 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:08,147 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:08,147 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:08,148 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:08,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {43712#(<= fibo1_~n 4)} assume !(~n < 1); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:08,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {43712#(<= fibo1_~n 4)} assume !(1 == ~n); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:08,149 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:08,149 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:08,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {43714#(<= fibo2_~n 3)} assume !(~n < 1); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {43714#(<= fibo2_~n 3)} assume !(1 == ~n); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,150 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:08,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {43708#true} assume !(1 == ~n); {43708#true} is VALID [2022-02-21 04:20:08,150 INFO L272 TraceCheckUtils]: 14: Hoare triple {43708#true} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:08,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:08,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,151 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:08,151 INFO L272 TraceCheckUtils]: 20: Hoare triple {43708#true} call #t~ret5 := fibo2(~n - 2); {43708#true} is VALID [2022-02-21 04:20:08,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:08,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,151 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:08,151 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:08,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,152 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:08,153 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:08,153 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:08,153 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:08,154 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:08,154 INFO L272 TraceCheckUtils]: 32: Hoare triple {43709#false} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:08,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:08,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,154 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {43708#true} {43709#false} #50#return; {43709#false} is VALID [2022-02-21 04:20:08,155 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:08,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:08,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835845875] [2022-02-21 04:20:08,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835845875] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:08,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032972676] [2022-02-21 04:20:08,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:08,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,171 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:08,184 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:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:08,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:20:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:08,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:08,384 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:08,385 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:08,386 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:08,386 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:08,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {43712#(<= fibo1_~n 4)} assume !(~n < 1); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:08,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {43712#(<= fibo1_~n 4)} assume !(1 == ~n); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:08,387 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:08,388 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:08,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {43714#(<= fibo2_~n 3)} assume !(~n < 1); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {43714#(<= fibo2_~n 3)} assume !(1 == ~n); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,388 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:08,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {43708#true} assume !(1 == ~n); {43708#true} is VALID [2022-02-21 04:20:08,389 INFO L272 TraceCheckUtils]: 14: Hoare triple {43708#true} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:08,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:08,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,389 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:08,390 INFO L272 TraceCheckUtils]: 20: Hoare triple {43708#true} call #t~ret5 := fibo2(~n - 2); {43708#true} is VALID [2022-02-21 04:20:08,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:08,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,390 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:08,390 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:08,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,391 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:08,391 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:08,392 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:08,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {43733#(<= fibo1_~n 1)} assume !(~n < 1); {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:08,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {43733#(<= fibo1_~n 1)} assume !(1 == ~n); {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:08,392 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:08,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {43708#true} ~n := #in~n; {43851#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:08,393 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:08,394 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:08,394 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:08,394 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:08,395 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:08,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:08,682 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:08,683 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:08,683 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:08,683 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:08,684 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:08,684 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:08,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {43733#(<= fibo1_~n 1)} assume !(1 == ~n); {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:08,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {43733#(<= fibo1_~n 1)} assume !(~n < 1); {43733#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:08,685 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:08,686 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:08,686 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:08,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,686 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:08,686 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {43708#true} {43708#true} #52#return; {43708#true} is VALID [2022-02-21 04:20:08,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {43708#true} assume ~n < 1;#res := 0; {43708#true} is VALID [2022-02-21 04:20:08,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,687 INFO L272 TraceCheckUtils]: 20: Hoare triple {43708#true} call #t~ret5 := fibo2(~n - 2); {43708#true} is VALID [2022-02-21 04:20:08,687 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {43708#true} {43708#true} #50#return; {43708#true} is VALID [2022-02-21 04:20:08,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {43708#true} assume true; {43708#true} is VALID [2022-02-21 04:20:08,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {43708#true} assume 1 == ~n;#res := 1; {43708#true} is VALID [2022-02-21 04:20:08,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,687 INFO L272 TraceCheckUtils]: 14: Hoare triple {43708#true} call #t~ret4 := fibo2(~n - 1); {43708#true} is VALID [2022-02-21 04:20:08,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {43708#true} assume !(1 == ~n); {43708#true} is VALID [2022-02-21 04:20:08,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {43708#true} assume !(~n < 1); {43708#true} is VALID [2022-02-21 04:20:08,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {43708#true} ~n := #in~n; {43708#true} is VALID [2022-02-21 04:20:08,688 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:08,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {43714#(<= fibo2_~n 3)} assume !(1 == ~n); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {43714#(<= fibo2_~n 3)} assume !(~n < 1); {43714#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,689 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:08,689 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:08,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {43712#(<= fibo1_~n 4)} assume !(1 == ~n); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:08,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {43712#(<= fibo1_~n 4)} assume !(~n < 1); {43712#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:08,690 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:08,691 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:08,691 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:08,691 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:08,692 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:08,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032972676] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:08,692 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:08,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2022-02-21 04:20:08,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819175363] [2022-02-21 04:20:08,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:08,693 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:08,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1489002864, now seen corresponding path program 1 times [2022-02-21 04:20:08,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:08,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045862081] [2022-02-21 04:20:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:08,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:08,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:08,699 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:08,889 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:08,890 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:08,890 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:08,890 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:08,890 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:08,890 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,890 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:08,890 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:08,890 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration8_Loop [2022-02-21 04:20:08,890 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:08,890 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:08,891 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,893 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,894 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,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:08,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:08,900 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,901 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,906 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,908 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,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:08,971 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:08,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,972 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:08,973 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:08,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:08,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:08,980 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:08,980 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:08,995 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:08,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,997 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:08,997 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:09,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,021 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:09,021 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:09,036 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:09,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,038 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:09,039 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:09,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,046 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:09,046 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:09,061 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:09,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,063 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:09,063 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:09,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,073 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:09,073 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:09,088 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:09,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,089 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:09,090 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:09,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:09,099 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:09,140 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: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 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:09,143 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:09,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,156 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:09,156 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:09,171 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:09,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,174 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:09,175 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:09,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,203 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:09,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,205 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:09,205 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:09,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:09,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,967 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:09,970 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:09,970 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:09,971 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:09,971 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:09,971 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:09,971 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:09,971 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,971 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:09,971 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:09,971 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration8_Loop [2022-02-21 04:20:09,971 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:09,971 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:09,971 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:09,973 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:09,975 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:09,977 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:09,979 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:09,981 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:09,982 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:09,987 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:09,989 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:10,059 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:10,059 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:10,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,061 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:10,062 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:10,063 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:10,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:10,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:10,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:10,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:10,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:10,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:10,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:10,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:10,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:10,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,103 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:10,118 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:10,119 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:10,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:10,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:10,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:10,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:10,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:10,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:10,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:10,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:10,145 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:10,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,146 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:10,147 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:10,149 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:10,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:10,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:10,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:10,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:10,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:10,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:10,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:10,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:10,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-02-21 04:20:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,194 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:10,194 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:10,196 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:10,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:10,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:10,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:10,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:10,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:10,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:10,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:10,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:10,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:10,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,234 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:10,235 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:10,236 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:10,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:10,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:10,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:10,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:10,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:10,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:10,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:10,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:10,259 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:10,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,262 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:10,262 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:10,264 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:10,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:10,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:10,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:10,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:10,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:10,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:10,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:10,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:10,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:10,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,290 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:10,291 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:10,293 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:10,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:10,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:10,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:10,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:10,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:10,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:10,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:10,302 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:10,303 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:20:10,303 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:20:10,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,305 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:10,306 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:10,307 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:10,307 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:10,307 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:10,307 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:10,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:10,328 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:10,330 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:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:20:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:10,571 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:10,683 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,683 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,684 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,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:10,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:10,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:10,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {43976#unseeded} call #t~ret4 := fibo2(~n - 1); {43976#unseeded} is VALID [2022-02-21 04:20:10,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:10,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:10,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:10,687 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:10,687 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:10,687 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:10,688 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:10,688 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:10,689 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:10,689 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:10,689 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:10,690 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:10,691 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:10,691 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:10,692 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:10,692 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:10,692 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:10,693 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:10,694 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:10,694 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:10,695 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:10,695 INFO L272 TraceCheckUtils]: 28: Hoare triple {43976#unseeded} call #t~ret7 := fibo1(~n - 2); {43976#unseeded} is VALID [2022-02-21 04:20:10,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:10,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:10,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:10,696 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:10,697 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:10,697 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:10,698 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:10,698 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:10,699 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:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:10,928 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:10,928 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:10,928 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:10,929 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:10,929 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:10,930 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:10,930 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:10,930 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:10,931 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:10,931 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:10,932 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:10,932 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:10,932 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:10,933 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:10,933 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,934 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,965 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,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,966 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:10,966 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,455 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:11,456 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:11,456 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:11,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:11,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:11,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:11,456 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,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:11,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:11,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:11,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 422 states and 463 transitions. [2022-02-21 04:20:11,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 04:20:11,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:11,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:11,460 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:11,465 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:11,465 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,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:11,466 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:11,466 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 422 states and 463 transitions. cyclomatic complexity: 52 [2022-02-21 04:20:11,471 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:11,471 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,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,472 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:11,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,472 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:11,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:11,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,472 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:11,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,472 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,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,473 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:11,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,473 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:11,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:11,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,474 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:11,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,474 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,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,474 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:11,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,474 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:11,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:11,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,475 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:11,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,475 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,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,475 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:11,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,476 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,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,476 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:11,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,476 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,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,477 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:11,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,477 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,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,477 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:11,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,478 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,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,478 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:11,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,478 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,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,479 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:11,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,479 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,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,479 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:11,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,479 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,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 42 letters. Loop has 8 letters. [2022-02-21 04:20:11,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,480 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:11,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,480 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,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 47 letters. Loop has 14 letters. [2022-02-21 04:20:11,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,480 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:11,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,481 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,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 41 letters. Loop has 8 letters. [2022-02-21 04:20:11,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,481 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:11,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,481 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,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,482 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:11,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,482 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,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,482 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:11,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,483 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,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 54 letters. Loop has 32 letters. [2022-02-21 04:20:11,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,483 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:11,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,483 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,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 62 letters. Loop has 26 letters. [2022-02-21 04:20:11,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,484 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:11,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,484 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,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,484 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:11,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,485 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,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,485 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:11,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,485 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,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,486 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:11,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,486 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,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,486 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:11,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,487 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,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 8 letters. [2022-02-21 04:20:11,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,487 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:11,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,487 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,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,488 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:11,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,488 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,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,488 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:11,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,489 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,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,489 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:11,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,489 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,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,490 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:11,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,490 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,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,490 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:11,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,490 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,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 67 letters. Loop has 8 letters. [2022-02-21 04:20:11,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,491 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:11,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,491 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,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,492 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:11,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,492 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,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 59 letters. Loop has 32 letters. [2022-02-21 04:20:11,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,492 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:11,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,492 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,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 38 letters. Loop has 32 letters. [2022-02-21 04:20:11,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,493 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:11,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,493 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,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,494 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:11,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,494 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,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 59 letters. Loop has 26 letters. [2022-02-21 04:20:11,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,494 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:11,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,494 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,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,495 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:11,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,495 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,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,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 69 letters. Loop has 8 letters. [2022-02-21 04:20:11,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,496 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:11,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,496 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,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,496 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:11,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,497 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,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,497 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:11,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,497 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,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,498 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:11,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,498 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,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,499 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:11,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,499 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,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,499 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:11,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,500 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,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,500 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:11,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,500 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,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,501 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:11,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,501 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,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,502 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:11,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,502 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,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,502 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:11,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,503 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,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,503 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:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,503 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,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,504 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:11,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,504 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,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,504 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:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,505 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,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,505 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:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,505 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,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,506 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:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,506 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,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,507 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:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,507 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,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,508 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:11,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,508 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,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,508 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:11,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,509 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,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,509 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:11,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,509 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,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,510 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:11,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,510 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:11,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:11,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,511 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:11,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,511 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,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,511 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:11,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,511 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,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,512 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:11,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,512 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,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,512 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:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,513 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,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,513 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:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,513 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,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,514 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:11,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,514 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,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,514 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:11,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,515 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,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,515 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:11,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,515 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,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,516 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:11,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,516 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,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,516 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:11,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,516 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,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,517 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:11,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,517 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,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,518 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:11,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,518 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,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,518 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:11,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,518 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,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,519 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:11,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,519 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,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,519 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:11,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,520 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,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,520 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:11,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,520 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,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,521 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:11,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,521 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,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,521 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:11,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,522 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,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,522 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:11,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,522 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,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,523 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:11,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,523 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,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,523 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:11,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,524 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,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,524 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:11,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,524 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,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,532 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:11,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,532 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,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,533 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:11,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,533 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,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,533 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:11,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,533 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,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,534 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:11,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,534 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,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,535 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:11,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,535 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,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,535 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:11,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,535 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,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,536 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:11,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,536 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,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,537 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:11,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,537 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,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,537 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:11,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,537 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,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,538 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:11,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,538 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,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,539 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:11,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,539 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,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,539 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:11,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,540 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,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,540 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:11,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,540 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,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,541 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:11,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,541 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,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,542 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:11,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,542 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,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,542 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:11,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,543 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,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,543 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:11,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,543 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,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,544 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:11,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,544 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,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,545 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:11,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,545 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,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,545 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:11,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,546 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,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,546 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:11,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,546 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,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,547 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:11,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,547 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,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,547 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:11,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,548 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,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,548 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:11,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,548 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,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,549 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:11,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,549 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,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,550 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:11,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,550 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,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,550 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:11,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,551 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,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,551 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:11,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,551 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,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,552 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:11,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,552 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,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,553 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:11,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,553 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:11,553 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,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-02-21 04:20:11,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:11,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,554 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:11,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:20:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:11,787 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,788 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,788 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,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:11,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:11,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:11,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {43976#unseeded} call #t~ret4 := fibo2(~n - 1); {43976#unseeded} is VALID [2022-02-21 04:20:11,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:11,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:11,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:11,790 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:11,791 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:11,791 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:11,791 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:11,792 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:11,792 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:11,793 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:11,793 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:11,793 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:11,794 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:11,794 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:11,795 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:11,795 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:11,795 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:11,796 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:11,796 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:11,797 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:11,797 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:11,798 INFO L272 TraceCheckUtils]: 28: Hoare triple {43976#unseeded} call #t~ret7 := fibo1(~n - 2); {43976#unseeded} is VALID [2022-02-21 04:20:11,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:11,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:11,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:11,799 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:11,799 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:11,799 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:11,800 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:11,800 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:11,801 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:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:11,941 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:11,941 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:11,941 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:11,942 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:11,942 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:11,942 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:11,943 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:11,943 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:11,943 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:11,943 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:11,944 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:11,944 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:11,944 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:11,972 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:11,972 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,973 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,996 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,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,997 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:11,997 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,294 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:12,294 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:12,294 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:12,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:12,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,294 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,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:12,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 375 transitions. [2022-02-21 04:20:12,297 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 04:20:12,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,297 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:12,297 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:12,298 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,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:12,298 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:12,298 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 344 states and 375 transitions. cyclomatic complexity: 40 [2022-02-21 04:20:12,303 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:12,303 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,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 38 letters. Loop has 14 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 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 3 letters. Loop has 9 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 3 letters. Loop has 9 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 3 letters. Loop has 9 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 38 letters. Loop has 14 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 38 letters. Loop has 14 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 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 344 letters. Loop has 344 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 344 letters. Loop has 344 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 344 letters. Loop has 344 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 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 271 letters. Loop has 271 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 271 letters. Loop has 271 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 271 letters. Loop has 271 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 9 letters. Loop has 9 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 9 letters. Loop has 9 letters. [2022-02-21 04:20:12,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,307 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: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 48 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 48 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 48 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 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,307 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 47 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 47 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 45 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 45 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 45 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 43 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 43 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 43 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 46 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 46 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 46 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 44 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 has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,310 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: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 62 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 62 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 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 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 42 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 42 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 8 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 47 letters. Loop has 14 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 47 letters. Loop has 14 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 47 letters. Loop has 14 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 41 letters. Loop has 8 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 41 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 41 letters. Loop has 8 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 54 letters. Loop has 14 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 54 letters. Loop has 14 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 14 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 62 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 62 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 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 54 letters. Loop has 32 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 54 letters. Loop has 32 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 32 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 62 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 has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,316 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: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 54 letters. Loop has 14 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 54 letters. Loop has 14 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 54 letters. Loop has 14 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 59 letters. Loop has 26 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 59 letters. Loop has 26 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 26 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 38 letters. Loop has 14 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 38 letters. Loop has 14 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 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 63 letters. Loop has 8 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 63 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 63 letters. Loop has 8 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 62 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 62 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 62 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 60 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 has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,319 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: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 61 letters. Loop has 8 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 61 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 61 letters. Loop has 8 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 38 letters. Loop has 14 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 38 letters. Loop has 14 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 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 66 letters. Loop has 8 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 66 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,321 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 65 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 65 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 65 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 67 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 67 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 67 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 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 has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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 344 states and 375 transitions. cyclomatic complexity: 40 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 32 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 59 letters. Loop has 32 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 letters. Loop has 32 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 38 letters. Loop has 32 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 38 letters. Loop has 32 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 32 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 38 letters. Loop has 14 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 38 letters. Loop has 14 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 38 letters. Loop has 14 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 59 letters. Loop has 26 letters. [2022-02-21 04:20:12,325 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 59 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 59 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 271 states and 298 transitions. cyclomatic complexity: 35 Stem has 65 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 has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,326 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: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 69 letters. Loop has 8 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 69 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 69 letters. Loop has 8 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 64 letters. Loop has 8 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 64 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 64 letters. Loop has 8 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 26 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 26 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 82 letters. Loop has 26 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 74 letters. Loop has 14 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 74 letters. Loop has 14 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 74 letters. Loop has 14 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 70 letters. Loop has 8 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 70 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 70 letters. Loop has 8 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 60 letters. Loop has 32 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 60 letters. Loop has 32 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 60 letters. Loop has 32 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 63 letters. Loop has 8 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 63 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,331 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 62 letters. Loop has 26 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 has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,332 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: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 59 letters. Loop has 26 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 has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,333 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:12,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,333 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,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 67 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:12,333 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 66 letters. Loop has 8 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 66 letters. Loop has 8 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 344 states and 375 transitions. cyclomatic complexity: 40 Stem has 66 letters. Loop has 8 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 68 letters. Loop has 8 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 68 letters. Loop has 8 letters. [2022-02-21 04:20:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,335 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:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,335 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,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,336 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:12,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,336 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,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,336 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:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,337 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,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,337 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:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,337 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,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,338 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:12,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,338 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,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,338 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:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,339 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,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,339 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:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,339 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,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,340 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:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,340 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,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,340 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:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,341 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:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,341 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:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,341 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,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,342 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:12,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,342 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,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,342 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:12,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,343 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,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,357 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:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,358 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,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,358 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:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,358 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,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,359 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:12,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,359 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,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,360 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:12,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,360 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,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,360 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:12,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,360 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,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,361 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:12,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,361 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,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,361 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:12,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,362 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,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,362 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:12,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,362 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,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,363 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:12,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,363 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,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,363 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:12,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,364 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,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,364 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:12,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,364 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,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,365 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:12,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,365 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,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,365 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:12,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,366 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,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,366 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:12,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,366 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,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,367 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:12,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,367 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,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,367 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:12,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,367 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,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,368 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:12,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,368 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,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,369 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:12,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,369 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,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,369 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:12,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,369 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,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,370 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:12,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,370 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,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,370 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:12,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,371 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,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,371 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:12,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,371 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,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,372 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:12,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,372 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,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,372 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:12,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,373 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,373 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:12,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,373 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,374 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:12,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,374 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,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,374 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:12,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,374 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,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,375 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:12,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,375 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,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,376 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:12,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,376 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,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,376 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:12,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,377 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,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,377 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:12,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,377 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,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,378 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:12,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,378 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,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,378 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:12,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,379 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,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,379 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:12,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,379 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,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,380 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:12,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,380 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,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,380 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:12,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,381 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,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,381 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:12,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,381 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,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,382 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:12,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,382 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,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,382 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:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,383 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,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,383 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:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,383 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,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,384 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:12,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,384 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,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,385 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:12,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,385 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,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,385 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:12,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,385 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,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,386 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:12,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,386 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,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,387 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:12,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,387 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,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,387 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:12,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,387 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,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,388 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:12,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,388 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,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,389 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:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,389 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,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,389 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:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,390 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:12,390 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,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2022-02-21 04:20:12,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 31 transitions. Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:12,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,391 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:20:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:12,676 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:12,676 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:12,677 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:12,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:12,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:12,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:12,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {43976#unseeded} call #t~ret4 := fibo2(~n - 1); {43976#unseeded} is VALID [2022-02-21 04:20:12,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:12,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:12,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:12,679 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:12,680 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:12,680 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:12,680 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:12,681 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:12,681 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:12,682 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:12,682 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:12,683 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:12,683 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:12,684 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:12,684 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:12,685 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:12,685 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:12,686 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:12,686 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:12,687 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:12,687 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:12,688 INFO L272 TraceCheckUtils]: 28: Hoare triple {43976#unseeded} call #t~ret7 := fibo1(~n - 2); {43976#unseeded} is VALID [2022-02-21 04:20:12,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {43976#unseeded} ~n := #in~n; {43976#unseeded} is VALID [2022-02-21 04:20:12,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {43976#unseeded} assume !(~n < 1); {43976#unseeded} is VALID [2022-02-21 04:20:12,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {43976#unseeded} assume !(1 == ~n); {43976#unseeded} is VALID [2022-02-21 04:20:12,689 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:12,689 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:12,690 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:12,690 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:12,691 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:12,691 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:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:12,914 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:12,915 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:12,915 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:12,915 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:12,916 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:12,916 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:12,916 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:12,917 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:12,917 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:12,918 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:12,918 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:12,918 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:12,919 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:12,919 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:12,920 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:12,920 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:12,950 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:12,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,951 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:12,951 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:13,517 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:13,518 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:13,518 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:13,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:13,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:13,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:13,518 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:13,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:13,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:13,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:13,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1102 states and 1208 transitions. [2022-02-21 04:20:13,523 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 162 [2022-02-21 04:20:13,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:13,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:13,524 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 271 states and 298 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:13,524 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 51 examples of accepted words. [2022-02-21 04:20:13,524 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:13,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:13,525 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:13,525 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 [2022-02-21 04:20:13,533 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 88 examples of accepted words. [2022-02-21 04:20:13,533 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:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,534 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:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,534 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:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,535 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:13,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,535 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:13,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,535 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:13,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,536 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:13,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,536 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:13,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,536 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:13,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,537 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:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,537 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:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,537 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:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,537 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:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,538 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:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,538 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:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,538 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:13,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,539 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:13,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,539 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:13,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,539 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:13,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,540 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:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,540 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:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,540 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:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,541 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:13,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,541 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:13,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,541 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:13,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,542 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:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,542 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:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,542 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:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,543 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:13,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,543 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:13,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,543 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:13,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,544 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:13,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,544 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:13,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,544 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:13,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,545 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:13,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,545 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:13,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,545 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:13,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,546 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:13,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,546 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:13,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,547 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:13,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,547 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:13,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,547 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:13,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,548 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:13,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,548 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:13,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,548 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:13,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,549 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:13,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,549 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:13,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,550 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:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,550 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:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,550 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:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,550 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:13,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,551 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:13,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,551 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:13,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,552 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:13,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,552 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:13,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,552 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:13,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,553 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:13,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,553 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:13,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,553 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:13,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,554 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:13,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,554 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:13,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,554 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:13,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,555 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:13,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,555 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:13,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,555 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:13,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,556 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:13,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,556 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:13,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,557 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:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,557 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:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,557 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:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,557 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:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,558 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:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,558 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:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,559 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:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,559 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:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,559 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:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,560 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:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,560 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:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,560 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:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,561 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:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,561 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:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,562 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:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,562 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:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,563 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:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,563 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:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,563 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:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,564 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:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,564 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:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,564 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:13,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,565 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:13,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,565 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:13,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,566 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:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,566 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:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,567 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:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,567 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:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,567 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:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,567 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:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,568 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:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,568 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:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,569 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:13,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,569 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:13,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,569 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:13,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,570 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:13,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,570 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:13,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,571 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:13,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,571 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:13,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,571 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:13,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,572 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:13,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,572 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:13,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,573 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:13,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,573 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:13,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,574 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:13,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,574 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:13,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,575 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:13,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,575 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:13,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,575 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:13,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,575 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:13,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,576 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:13,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,576 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:13,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,577 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:13,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,577 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:13,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,577 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:13,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,578 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:13,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,578 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:13,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,578 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:13,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,579 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:13,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,579 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:13,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,579 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:13,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,580 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:13,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,580 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:13,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,581 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:13,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,581 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:13,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,581 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:13,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,582 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:13,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,582 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:13,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,583 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:13,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,583 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:13,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,583 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:13,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,584 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:13,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,584 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:13,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,584 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:13,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,585 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:13,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,585 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:13,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,586 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:13,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,586 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:13,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,587 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:13,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,587 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:13,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,588 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:13,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,588 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:13,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,589 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:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,589 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:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,591 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:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,591 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:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,591 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:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,592 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,592 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,592 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,592 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,593 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,593 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,594 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:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,594 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:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,594 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:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,594 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:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,595 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:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,595 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:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,596 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:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,596 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:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,596 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:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,596 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:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,597 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:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,597 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:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,598 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,598 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,598 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:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,599 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:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,599 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:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,599 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:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,600 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:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,600 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:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,601 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,601 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,601 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,602 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:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,602 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:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,602 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:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,603 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:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,603 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:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,604 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:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,604 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:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,604 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:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,605 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:13,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,605 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:13,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,605 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:13,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,606 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:13,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,606 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:13,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,607 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:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,607 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:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,607 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:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,608 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:13,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,608 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:13,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,609 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:13,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,609 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:13,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,609 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:13,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,610 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:13,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,610 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:13,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,611 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:13,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,611 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:13,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,612 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:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,612 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:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,613 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:13,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,613 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:13,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,613 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:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,614 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:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,614 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:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,614 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:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,615 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:13,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,615 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:13,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,615 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:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,616 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:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,616 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:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,616 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:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,617 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:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,617 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:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,618 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:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,618 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:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,618 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:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,618 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:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,619 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:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,619 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:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,620 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:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,620 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:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,620 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:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,620 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:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,621 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:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,621 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:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,622 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:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,622 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:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,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 59 letters. Loop has 32 letters. [2022-02-21 04:20:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,622 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:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,623 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:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,623 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:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,623 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:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,624 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:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,624 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:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,625 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:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,625 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:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,626 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:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,626 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:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,626 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:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,627 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:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,627 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:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,627 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:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,628 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:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,628 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:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,629 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:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,629 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:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,629 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:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,630 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:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,630 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:13,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,631 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:13,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,631 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:13,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,631 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:13,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,632 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:13,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,632 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:13,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,633 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:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,633 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:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,633 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:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,634 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:13,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,634 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:13,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,634 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:13,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,635 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:13,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,635 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:13,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,635 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:13,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,636 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:13,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,636 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:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,637 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:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,637 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:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,638 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:13,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,638 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:13,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,638 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:13,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,639 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:13,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,639 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:13,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,640 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:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,640 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:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,641 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:13,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,641 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:13,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,642 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:13,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,642 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:13,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (10), 5 states 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:13,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,643 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:13,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,643 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:13,643 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:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-21 04:20:13,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:20:13,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 52 letters. Loop has 14 letters. [2022-02-21 04:20:13,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 38 letters. Loop has 28 letters. [2022-02-21 04:20:13,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1102 states and 1208 transitions. cyclomatic complexity: 121 [2022-02-21 04:20:13,676 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 162 [2022-02-21 04:20:13,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1102 states to 538 states and 595 transitions. [2022-02-21 04:20:13,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2022-02-21 04:20:13,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2022-02-21 04:20:13,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 538 states and 595 transitions. [2022-02-21 04:20:13,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:13,688 INFO L681 BuchiCegarLoop]: Abstraction has 538 states and 595 transitions. [2022-02-21 04:20:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states and 595 transitions. [2022-02-21 04:20:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 419. [2022-02-21 04:20:13,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:13,694 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:13,694 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:13,694 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:13,695 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:13,710 INFO L93 Difference]: Finished difference Result 676 states and 759 transitions. [2022-02-21 04:20:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 759 transitions. [2022-02-21 04:20:13,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:13,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:13,713 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:13,713 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:13,713 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:13,737 INFO L93 Difference]: Finished difference Result 865 states and 998 transitions. [2022-02-21 04:20:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 998 transitions. [2022-02-21 04:20:13,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:13,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:13,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:13,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:13,740 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:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 456 transitions. [2022-02-21 04:20:13,746 INFO L704 BuchiCegarLoop]: Abstraction has 419 states and 456 transitions. [2022-02-21 04:20:13,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:13,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 04:20:13,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-02-21 04:20:13,747 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:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:14,004 INFO L93 Difference]: Finished difference Result 229 states and 241 transitions. [2022-02-21 04:20:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 04:20:14,005 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:14,032 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:14,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 241 transitions. [2022-02-21 04:20:14,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:14,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 83 states and 86 transitions. [2022-02-21 04:20:14,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-02-21 04:20:14,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-02-21 04:20:14,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 86 transitions. [2022-02-21 04:20:14,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:14,036 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-02-21 04:20:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 86 transitions. [2022-02-21 04:20:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2022-02-21 04:20:14,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:14,037 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:14,037 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:14,037 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:14,038 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:14,038 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-02-21 04:20:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-02-21 04:20:14,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:14,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:14,039 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:14,039 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:14,039 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:14,040 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-02-21 04:20:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-02-21 04:20:14,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:14,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:14,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:14,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:14,041 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:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2022-02-21 04:20:14,042 INFO L704 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2022-02-21 04:20:14,042 INFO L587 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2022-02-21 04:20:14,042 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:20:14,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. [2022-02-21 04:20:14,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:14,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:14,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:14,043 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:14,043 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-02-21 04:20:14,043 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:14,043 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:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash -979062994, now seen corresponding path program 2 times [2022-02-21 04:20:14,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:14,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635116210] [2022-02-21 04:20:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:14,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:14,050 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:14,054 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash -636561399, now seen corresponding path program 2 times [2022-02-21 04:20:14,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:14,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46955785] [2022-02-21 04:20:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:14,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:14,061 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:14,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash -13748362, now seen corresponding path program 3 times [2022-02-21 04:20:14,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:14,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265082995] [2022-02-21 04:20:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:14,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-21 04:20:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,142 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:14,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:14,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:14,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:14,145 INFO L272 TraceCheckUtils]: 3: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:14,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,146 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:14,146 INFO L272 TraceCheckUtils]: 9: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:14,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:14,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,146 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:14,147 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:14,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,147 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,150 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:14,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:14,150 INFO L272 TraceCheckUtils]: 3: Hoare triple {50430#true} call #t~ret6 := fibo1(~n - 1); {50430#true} is VALID [2022-02-21 04:20:14,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:14,151 INFO L272 TraceCheckUtils]: 7: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:14,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,151 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:14,151 INFO L272 TraceCheckUtils]: 13: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:14,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:14,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,152 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:14,152 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:14,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,152 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:14,152 INFO L272 TraceCheckUtils]: 21: Hoare triple {50430#true} call #t~ret7 := fibo1(~n - 2); {50430#true} is VALID [2022-02-21 04:20:14,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,153 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:14,153 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:14,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,153 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:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 04:20:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,157 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50430#true} {50431#false} #50#return; {50431#false} is VALID [2022-02-21 04:20:14,157 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:14,157 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:14,158 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:14,158 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:14,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {50434#(<= fibo1_~n 4)} assume !(~n < 1); {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:14,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {50434#(<= fibo1_~n 4)} assume !(1 == ~n); {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:14,159 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:14,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:14,159 INFO L272 TraceCheckUtils]: 10: Hoare triple {50430#true} call #t~ret6 := fibo1(~n - 1); {50430#true} is VALID [2022-02-21 04:20:14,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:14,160 INFO L272 TraceCheckUtils]: 14: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:14,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,160 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:14,160 INFO L272 TraceCheckUtils]: 20: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:14,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:14,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,161 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:14,161 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:14,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,161 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:14,161 INFO L272 TraceCheckUtils]: 28: Hoare triple {50430#true} call #t~ret7 := fibo1(~n - 2); {50430#true} is VALID [2022-02-21 04:20:14,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,162 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:14,162 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:14,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,162 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:14,163 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:14,163 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:14,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {50466#(<= fibo2_~n 2)} assume !(~n < 1); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:14,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {50466#(<= fibo2_~n 2)} assume !(1 == ~n); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:14,164 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:14,164 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:14,165 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:14,165 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:14,165 INFO L272 TraceCheckUtils]: 45: Hoare triple {50431#false} call #t~ret4 := fibo2(~n - 1); {50431#false} is VALID [2022-02-21 04:20:14,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {50431#false} ~n := #in~n; {50431#false} is VALID [2022-02-21 04:20:14,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {50431#false} assume !(~n < 1); {50431#false} is VALID [2022-02-21 04:20:14,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {50431#false} assume !(1 == ~n); {50431#false} is VALID [2022-02-21 04:20:14,166 INFO L272 TraceCheckUtils]: 49: Hoare triple {50431#false} call #t~ret6 := fibo1(~n - 1); {50431#false} is VALID [2022-02-21 04:20:14,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {50431#false} ~n := #in~n; {50431#false} is VALID [2022-02-21 04:20:14,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {50431#false} assume !(~n < 1); {50431#false} is VALID [2022-02-21 04:20:14,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {50431#false} assume !(1 == ~n); {50431#false} is VALID [2022-02-21 04:20:14,166 INFO L272 TraceCheckUtils]: 53: Hoare triple {50431#false} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:14,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,167 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {50430#true} {50431#false} #50#return; {50431#false} is VALID [2022-02-21 04:20:14,167 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:14,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:14,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265082995] [2022-02-21 04:20:14,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265082995] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:14,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707694378] [2022-02-21 04:20:14,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 04:20:14,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,185 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:14,186 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:14,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-21 04:20:14,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 04:20:14,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:14,532 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:14,533 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:14,533 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:14,533 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:14,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {50434#(<= fibo1_~n 4)} assume !(~n < 1); {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:14,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {50434#(<= fibo1_~n 4)} assume !(1 == ~n); {50434#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:14,534 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:14,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:14,535 INFO L272 TraceCheckUtils]: 10: Hoare triple {50430#true} call #t~ret6 := fibo1(~n - 1); {50430#true} is VALID [2022-02-21 04:20:14,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:14,535 INFO L272 TraceCheckUtils]: 14: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:14,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,536 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:14,536 INFO L272 TraceCheckUtils]: 20: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:14,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:14,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,536 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:14,536 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:14,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,537 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:14,537 INFO L272 TraceCheckUtils]: 28: Hoare triple {50430#true} call #t~ret7 := fibo1(~n - 2); {50430#true} is VALID [2022-02-21 04:20:14,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:14,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:14,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:14,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,537 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:14,537 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:14,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:14,538 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:14,539 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:14,539 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:14,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {50466#(<= fibo2_~n 2)} assume !(~n < 1); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:14,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {50466#(<= fibo2_~n 2)} assume !(1 == ~n); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:14,540 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:14,541 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:14,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {50468#(<= fibo1_~n 1)} assume !(~n < 1); {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:14,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {50468#(<= fibo1_~n 1)} assume !(1 == ~n); {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:14,542 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:14,542 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:14,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {50648#(<= fibo2_~n 0)} assume !(~n < 1); {50648#(<= fibo2_~n 0)} is VALID [2022-02-21 04:20:14,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {50648#(<= fibo2_~n 0)} assume !(1 == ~n); {50648#(<= fibo2_~n 0)} is VALID [2022-02-21 04:20:14,543 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:14,544 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:14,544 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:14,544 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:14,545 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:14,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {50430#true} ~n := #in~n; {50675#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,545 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:14,546 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:14,546 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:14,547 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:14,547 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:14,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:15,037 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:15,037 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:15,038 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:15,038 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:15,039 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:15,039 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:15,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {50468#(<= fibo1_~n 1)} assume !(1 == ~n); {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:15,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {50468#(<= fibo1_~n 1)} assume !(~n < 1); {50468#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:15,040 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:15,041 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:15,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {50466#(<= fibo2_~n 2)} assume !(1 == ~n); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:15,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {50466#(<= fibo2_~n 2)} assume !(~n < 1); {50466#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:15,042 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:15,042 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:15,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {50729#(<= fibo1_~n 3)} assume !(1 == ~n); {50729#(<= fibo1_~n 3)} is VALID [2022-02-21 04:20:15,043 INFO L290 TraceCheckUtils]: 43: Hoare triple {50729#(<= fibo1_~n 3)} assume !(~n < 1); {50729#(<= fibo1_~n 3)} is VALID [2022-02-21 04:20:15,043 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:15,044 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:15,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {50743#(<= fibo2_~n 4)} assume !(1 == ~n); {50743#(<= fibo2_~n 4)} is VALID [2022-02-21 04:20:15,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {50743#(<= fibo2_~n 4)} assume !(~n < 1); {50743#(<= fibo2_~n 4)} is VALID [2022-02-21 04:20:15,045 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:15,046 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:15,046 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:15,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:15,046 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:15,047 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {50430#true} {50430#true} #48#return; {50430#true} is VALID [2022-02-21 04:20:15,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:15,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:15,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:15,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:15,047 INFO L272 TraceCheckUtils]: 28: Hoare triple {50430#true} call #t~ret7 := fibo1(~n - 2); {50430#true} is VALID [2022-02-21 04:20:15,047 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {50430#true} {50430#true} #46#return; {50430#true} is VALID [2022-02-21 04:20:15,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:15,047 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:15,048 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {50430#true} {50430#true} #52#return; {50430#true} is VALID [2022-02-21 04:20:15,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:15,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {50430#true} assume ~n < 1;#res := 0; {50430#true} is VALID [2022-02-21 04:20:15,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:15,048 INFO L272 TraceCheckUtils]: 20: Hoare triple {50430#true} call #t~ret5 := fibo2(~n - 2); {50430#true} is VALID [2022-02-21 04:20:15,048 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {50430#true} {50430#true} #50#return; {50430#true} is VALID [2022-02-21 04:20:15,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {50430#true} assume true; {50430#true} is VALID [2022-02-21 04:20:15,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {50430#true} assume 1 == ~n;#res := 1; {50430#true} is VALID [2022-02-21 04:20:15,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:15,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:15,049 INFO L272 TraceCheckUtils]: 14: Hoare triple {50430#true} call #t~ret4 := fibo2(~n - 1); {50430#true} is VALID [2022-02-21 04:20:15,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:15,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:15,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:15,049 INFO L272 TraceCheckUtils]: 10: Hoare triple {50430#true} call #t~ret6 := fibo1(~n - 1); {50430#true} is VALID [2022-02-21 04:20:15,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {50430#true} assume !(1 == ~n); {50430#true} is VALID [2022-02-21 04:20:15,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {50430#true} assume !(~n < 1); {50430#true} is VALID [2022-02-21 04:20:15,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {50430#true} ~n := #in~n; {50430#true} is VALID [2022-02-21 04:20:15,050 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:15,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {50757#(<= fibo1_~n 6)} assume !(1 == ~n); {50757#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:15,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {50757#(<= fibo1_~n 6)} assume !(~n < 1); {50757#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:15,051 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:15,051 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:15,052 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:15,052 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:15,052 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:15,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707694378] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:15,052 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:15,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 24 [2022-02-21 04:20:15,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830194124] [2022-02-21 04:20:15,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:15,435 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:15,435 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:15,435 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:15,435 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:15,435 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:15,435 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,435 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:15,435 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:15,435 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration9_Loop [2022-02-21 04:20:15,435 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:15,435 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:15,436 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:15,438 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:15,440 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:15,442 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:15,444 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:15,446 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:15,448 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:15,453 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:15,454 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:15,521 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:15,521 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:15,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,522 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:15,523 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:15,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:15,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:15,531 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:15,532 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:15,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:15,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,549 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:15,549 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:15,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:15,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:15,557 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:15,558 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:15,573 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:15,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,574 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:15,576 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:15,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:15,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:15,598 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:15,598 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:15,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:15,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,616 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:15,616 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:15,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:15,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:15,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:15,624 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:15,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:15,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,642 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:15,642 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:15,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:15,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:15,650 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:15,650 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:15,666 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:15,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,675 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:15,676 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:15,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:15,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:15,683 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:15,683 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:15,699 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:15,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,701 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:15,702 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:15,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:15,703 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:15,739 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:15,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,740 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:15,741 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:15,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:15,742 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:16,173 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:16,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-02-21 04:20:16,181 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:16,181 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:16,181 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:16,181 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:16,181 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:16,181 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:16,182 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:16,182 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:16,182 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_4-2.c_Iteration9_Loop [2022-02-21 04:20:16,182 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:16,182 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:16,182 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:16,184 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:16,186 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:16,188 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:16,189 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:16,194 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:16,196 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:16,198 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:16,199 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:16,268 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:16,268 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:16,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:16,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:16,269 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:16,270 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:16,271 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:16,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:16,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:16,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:16,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:16,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:16,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:16,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:16,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:16,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:16,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:16,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:16,298 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:16,299 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:16,301 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:16,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:16,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:16,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:16,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:16,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:16,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:16,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:16,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:16,324 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:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:16,326 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:16,326 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:16,328 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:16,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:16,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:16,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:16,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:16,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:16,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:16,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:16,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:16,351 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:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:16,353 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:16,354 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:16,363 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:16,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:16,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:16,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:16,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:16,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:16,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:16,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:16,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:16,402 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:16,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:16,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:16,403 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:16,404 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:16,405 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:16,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:16,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:16,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:16,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:16,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:16,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:16,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:16,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:16,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:20:16,426 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:20:16,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:16,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:16,428 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:16,428 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:16,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:16,430 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:16,430 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:16,430 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:16,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:16,448 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:16,450 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:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:16,776 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,776 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,777 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,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {50868#unseeded} ~n := #in~n; {50868#unseeded} is VALID [2022-02-21 04:20:16,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {50868#unseeded} assume !(~n < 1); {50868#unseeded} is VALID [2022-02-21 04:20:16,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {50868#unseeded} assume !(1 == ~n); {50868#unseeded} is VALID [2022-02-21 04:20:16,778 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:16,781 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:16,781 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:16,782 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:16,782 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:16,782 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:16,783 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:16,783 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:16,784 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:16,784 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:16,784 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:16,785 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:16,785 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:16,786 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:16,786 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:16,786 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:16,787 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:16,787 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:16,788 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:16,788 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:16,788 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:16,789 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:16,790 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:16,790 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:16,790 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:16,791 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:16,799 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:16,800 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:16,800 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:16,801 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:16,801 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:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 04:20:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:17,008 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:17,132 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:17,133 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:17,133 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:17,134 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:17,134 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:17,134 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:17,135 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:17,135 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:17,136 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:17,136 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:17,136 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:17,136 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:17,137 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:17,137 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:17,138 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:17,138 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:17,138 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:17,139 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:17,139 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:17,140 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:17,140 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:17,141 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:17,141 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,141 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,202 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,203 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,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,203 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:17,203 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:17,372 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:17,372 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:17,373 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:17,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:17,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:17,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:17,373 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:17,373 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:17,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:17,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2022-02-21 04:20:17,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:17,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:17,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:17,375 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:17,375 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:17,375 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:17,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:17,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 21 transitions. cyclomatic complexity: 19 [2022-02-21 04:20:17,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:17,376 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:20:17,376 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 73 states and 75 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:17,376 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:17,376 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:17,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,376 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,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,377 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:17,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,377 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:17,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,377 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,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,377 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:17,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,378 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:17,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,378 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:17,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,378 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:17,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,378 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:17,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,378 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:17,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,379 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:17,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,379 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:17,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,379 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:17,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,379 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:17,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,379 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:17,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,380 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,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,380 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:17,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,380 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:17,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,381 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,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,381 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:17,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,381 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:17,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,381 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,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,381 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:17,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,382 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:17,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,382 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,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,382 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:17,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,382 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:17,383 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:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-21 04:20:17,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:17,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,383 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:17,671 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,672 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,672 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,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {50868#unseeded} ~n := #in~n; {50868#unseeded} is VALID [2022-02-21 04:20:17,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {50868#unseeded} assume !(~n < 1); {50868#unseeded} is VALID [2022-02-21 04:20:17,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {50868#unseeded} assume !(1 == ~n); {50868#unseeded} is VALID [2022-02-21 04:20:17,673 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:17,674 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:17,674 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:17,674 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:17,675 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:17,675 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:17,675 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:17,676 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:17,676 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:17,676 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:17,677 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:17,677 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:17,677 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:17,678 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:17,679 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:17,679 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:17,679 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:17,680 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:17,680 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:17,681 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:17,681 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:17,682 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:17,682 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:17,682 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:17,683 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:17,683 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:17,683 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:17,684 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:17,684 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:17,685 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:17,685 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:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 04:20:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:17,982 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:17,983 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:17,983 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:17,984 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:17,984 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:17,984 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:17,985 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:17,985 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:17,985 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:17,986 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:17,986 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:17,986 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:17,987 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:17,987 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:17,987 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:17,988 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:17,988 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:17,988 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:17,989 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:17,989 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:17,990 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:17,990 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:17,990 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,991 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,029 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,029 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,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,030 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:18,030 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,180 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:18,180 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:18,180 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:18,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:18,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,180 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,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:18,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:18,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2022-02-21 04:20:18,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:18,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,182 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:18,182 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:18,182 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,182 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:18,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 21 transitions. cyclomatic complexity: 19 [2022-02-21 04:20:18,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:18,183 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:20:18,183 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 73 states and 75 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:18,183 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:18,183 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,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,189 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,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,189 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:18,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,190 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,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,190 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,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,190 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:18,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,191 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:18,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,191 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:18,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,191 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:18,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,191 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,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,191 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,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,192 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:18,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,192 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:18,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,192 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:18,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,192 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:18,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,192 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,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,193 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,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,193 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:18,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,193 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,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,193 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,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,193 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:18,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,194 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,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,194 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,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,194 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:18,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,194 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,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,194 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,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,195 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:18,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,195 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:18,195 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,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-21 04:20:18,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:18,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,196 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:18,517 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,517 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,518 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,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {50868#unseeded} ~n := #in~n; {50868#unseeded} is VALID [2022-02-21 04:20:18,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {50868#unseeded} assume !(~n < 1); {50868#unseeded} is VALID [2022-02-21 04:20:18,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {50868#unseeded} assume !(1 == ~n); {50868#unseeded} is VALID [2022-02-21 04:20:18,519 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:18,519 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:18,519 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:18,520 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:18,520 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:18,520 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:18,521 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:18,521 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:18,522 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:18,522 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:18,522 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:18,523 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:18,523 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:18,524 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:18,524 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:18,524 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:18,525 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:18,525 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:18,526 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:18,526 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:18,526 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:18,527 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:18,527 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:18,528 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:18,528 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:18,528 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:18,529 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:18,529 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:18,530 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:18,530 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:18,531 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:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 04:20:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:18,818 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:18,819 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:18,819 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:18,819 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:18,820 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:18,820 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:18,820 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:18,821 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:18,821 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:18,822 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:18,822 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:18,822 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:18,823 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:18,823 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:18,823 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:18,824 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:18,824 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:18,825 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:18,825 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:18,825 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:18,826 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:18,826 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:18,827 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,827 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,864 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,865 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,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,865 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:18,865 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,363 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:19,363 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:19,363 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:19,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:19,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:19,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:19,364 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,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:19,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:19,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:19,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 200 transitions. [2022-02-21 04:20:19,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-02-21 04:20:19,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:19,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:19,365 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:19,365 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:19,365 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,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:19,366 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:19,366 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 192 states and 200 transitions. cyclomatic complexity: 11 [2022-02-21 04:20:19,366 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:19,366 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,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,366 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,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,370 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:19,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,370 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:19,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,370 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:19,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,370 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:19,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,371 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:19,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,371 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:19,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,371 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:19,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,371 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:19,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,372 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:19,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,372 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:19,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,372 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,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,372 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,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,372 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:19,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,373 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:19,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,373 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:19,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,373 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:19,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,373 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,373 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,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,374 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:19,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,374 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,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,374 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,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,374 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:19,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,375 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:19,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,375 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:19,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,375 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:19,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,375 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:19,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,375 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:19,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,376 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:19,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,376 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:19,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,376 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:19,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,377 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:19,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,377 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:19,377 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,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2022-02-21 04:20:19,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:19,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,378 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:19,651 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:19,651 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:19,652 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:19,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {50868#unseeded} ~n := #in~n; {50868#unseeded} is VALID [2022-02-21 04:20:19,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {50868#unseeded} assume !(~n < 1); {50868#unseeded} is VALID [2022-02-21 04:20:19,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {50868#unseeded} assume !(1 == ~n); {50868#unseeded} is VALID [2022-02-21 04:20:19,653 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:19,653 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:19,653 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:19,654 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:19,654 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:19,654 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:19,655 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:19,655 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:19,655 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:19,655 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:19,656 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:19,656 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:19,656 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:19,657 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:19,657 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:19,658 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:19,658 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:19,658 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:19,659 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:19,659 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:19,659 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:19,660 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:19,660 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:19,660 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:19,661 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:19,661 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:19,661 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:19,662 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:19,662 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:19,662 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:19,663 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:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 04:20:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:19,866 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:19,866 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:19,866 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:19,867 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:19,867 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:19,867 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:19,868 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:19,868 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:19,868 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:19,868 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:19,869 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:19,869 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:19,869 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:19,870 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:19,870 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:19,870 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:19,870 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:19,871 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:19,871 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:19,871 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:19,872 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:19,872 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:19,872 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:19,873 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:19,898 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:19,898 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,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,898 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:19,898 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:20,409 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:20,409 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:20,409 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:20,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:20,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:20,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:20,409 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:20,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-02-21 04:20:20,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:20,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:20,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 112 transitions. [2022-02-21 04:20:20,410 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:20,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:20,410 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 68 transitions. cyclomatic complexity: 3 [2022-02-21 04:20:20,410 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:20,410 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:20,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-02-21 04:20:20,411 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:20,411 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 107 states and 112 transitions. cyclomatic complexity: 7 [2022-02-21 04:20:20,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 112 transitions. cyclomatic complexity: 7 [2022-02-21 04:20:20,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:20,411 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:20:20,411 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:20,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,411 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:20,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,412 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:20,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,412 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:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,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:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,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:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,413 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:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,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 107 letters. Loop has 107 letters. [2022-02-21 04:20:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,413 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:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,413 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:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,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 66 letters. Loop has 66 letters. [2022-02-21 04:20:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,413 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:20,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,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:20,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,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:20,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,414 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:20,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,414 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:20,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,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 37 letters. Loop has 22 letters. [2022-02-21 04:20:20,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,415 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:20,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,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:20,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,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:20,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,415 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:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,416 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:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,416 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:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,416 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:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,416 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:20,417 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:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-02-21 04:20:20,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 37 letters. Loop has 22 letters. [2022-02-21 04:20:20,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 59 letters. Loop has 22 letters. [2022-02-21 04:20:20,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 37 letters. Loop has 44 letters. [2022-02-21 04:20:20,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 112 transitions. cyclomatic complexity: 7 [2022-02-21 04:20:20,419 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:20,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 0 states and 0 transitions. [2022-02-21 04:20:20,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:20:20,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:20:20,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:20:20,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:20:20,420 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:20,420 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:20,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:20,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 04:20:20,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-02-21 04:20:20,420 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:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:20,421 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:20:20,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:20:20,421 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:20,459 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:20,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:20:20,460 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:20,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:20:20,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:20:20,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:20:20,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:20:20,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:20:20,460 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:20,460 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:20,460 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:20,460 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:20:20,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:20:20,461 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:20,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:20,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:20:20 BoogieIcfgContainer [2022-02-21 04:20:20,481 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:20:20,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:20:20,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:20:20,482 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:20:20,482 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:44" (3/4) ... [2022-02-21 04:20:20,484 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:20:20,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:20:20,485 INFO L158 Benchmark]: Toolchain (without parser) took 36669.73ms. Allocated memory was 86.0MB in the beginning and 283.1MB in the end (delta: 197.1MB). Free memory was 54.4MB in the beginning and 111.9MB in the end (delta: -57.4MB). Peak memory consumption was 138.2MB. Max. memory is 16.1GB. [2022-02-21 04:20:20,486 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:20:20,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.25ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 54.3MB in the beginning and 87.8MB in the end (delta: -33.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:20:20,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.27ms. Allocated memory is still 111.1MB. Free memory was 87.8MB in the beginning and 86.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:20:20,486 INFO L158 Benchmark]: Boogie Preprocessor took 20.68ms. Allocated memory is still 111.1MB. Free memory was 86.5MB in the beginning and 85.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:20:20,487 INFO L158 Benchmark]: RCFGBuilder took 187.33ms. Allocated memory is still 111.1MB. Free memory was 85.5MB in the beginning and 76.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:20:20,487 INFO L158 Benchmark]: BuchiAutomizer took 36227.16ms. Allocated memory was 111.1MB in the beginning and 283.1MB in the end (delta: 172.0MB). Free memory was 75.7MB in the beginning and 111.9MB in the end (delta: -36.1MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. [2022-02-21 04:20:20,487 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 283.1MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:20:20,488 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.18ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.25ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 54.3MB in the beginning and 87.8MB in the end (delta: -33.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.27ms. Allocated memory is still 111.1MB. Free memory was 87.8MB in the beginning and 86.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.68ms. Allocated memory is still 111.1MB. Free memory was 86.5MB in the beginning and 85.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 187.33ms. Allocated memory is still 111.1MB. Free memory was 85.5MB in the beginning and 76.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 36227.16ms. Allocated memory was 111.1MB in the beginning and 283.1MB in the end (delta: 172.0MB). Free memory was 75.7MB in the beginning and 111.9MB in the end (delta: -36.1MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 283.1MB. Free memory is still 111.9MB. 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.1s and 10 iterations. TraceHistogramMax:8. Analysis of lassos took 16.7s. Construction of modules took 2.9s. Büchi inclusion checks took 13.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 12. Automata minimization 2.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 516 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.5s 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, 2.9s 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: 47ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 33 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:20:20,528 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:20,729 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:20,943 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:21,131 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:21,330 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:21,530 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:21,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:21,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-02-21 04:20:22,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE